default search action
Daniel Singer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j8]Fadel Abdallah
, Camel Tanougast
Genetic algorithms for scheduling in a CPU/FPGA architecture with heterogeneous communication delays. Comput. Ind. Eng. 137 (2019) - 2017
- [j7]Moritz Mussgnug
Automated interpretation of eye-hand coordination in mobile eye tracking recordings - Identifying demanding phases in human-machine interactions. Künstliche Intell. 31(4): 331-337 (2017) - [c9]Fadel Abdallah, Camel Tanougast
A comparison of two metaheuristic algorithms for scheduling problem on a heterogeneous CPU/FPGA architecture with communication delays. CoDIT 2017: 294-299 - 2016
- [j6]Zineb Habbas, Kamal Amroun
Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints. RAIRO Oper. Res. 50(2): 241-267 (2016) - 2015
- [j5]Zineb Habbas, Kamal Amroun
A Forward-Checking algorithm based on a Generalised Hypertree Decomposition for solving non-binary constraint satisfaction problems. J. Exp. Theor. Artif. Intell. 27(5): 649-671 (2015) - 2014
- [c8]Lamia Sadeg-Belkacem, Zineb Habbas, Fatima Benbouzid-Si Tayeb, Daniel Singer:
Decomposition Tehniques for Solving Frequency Assigment Problems (FAP) - A Top-Down Approach. ICAART (1) 2014: 477-484 - 2011
- [c7]Zineb Habbas, Kamal Amroun, Daniel Singer:
Solving Non Binary Constraint Satisfaction Problems with Dual Backtracking on Hypertree Decomposition. ICAART (1) 2011: 146-156
2000 – 2009
- 2007
- [j4]Daniel Singer
Linearly ordered semigroups for fuzzy set theory. Ann. Math. Artif. Intell. 49(1-4): 207-220 (2007) - [c6]Daniel Singer
JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check. PPAM 2007: 249-258 - 2005
- [j3]Zineb Habbas, Michaël Krajecki, Daniel Singer:
Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study. Int. J. Comput. Sci. Eng. 1(2/3/4): 192-206 (2005) - [c5]Daniel Singer
Parallel Resolution of the Satisfiability Problem (SAT) with OpenMP and MPI. PPAM 2005: 380-388 - 2001
- [j2]Zineb Habbas, Michaël Krajecki
Shared Memory Implementation of Constraint Satisfaction Problem Resolution. Parallel Process. Lett. 11(4): 487-501 (2001) - [c4]Zineb Habbas, Michaël Krajecki, Daniel Singer:
The Langford's Problem: A Challenge for Parallel Resolution of CSP. PPAM 2001: 789-796 - 2000
- [j1]Daniel Singer:
Toolman. login Usenix Mag. 25(5) (2000)
1990 – 1999
- 1999
- [c3]Zineb Habbas, Francine Herrmann, Daniel Singer, Michaël Krajecki:
A Methodological Approach to Implement CSP on FPGA. IEEE International Workshop on Rapid System Prototyping 1999: 66- - 1997
- [c2]Zineb Habbas, Francine Herrmann, Pierre-Paul Mérel, Daniel Singer:
Load Balancing strategies for Parallel Forward Search Algorithm with Conflict Based Backjumping. ICPADS 1997: 376-381 - 1996
- [c1]Pierre-Paul Mérel, Zineb Habbas, Francine Herrmann
N-Ary Consistencies and Constraint-Based Backtracking. CP 1996: 551-552
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: