674 search results - page 61 / 135 » Subwebs for specialized search |
EPIA
1997
Springer
14 years 2 months ago
1997
Springer
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
Given the importance of optimization and informatics which are the two broad fields of research, we present an instance of Optinformatics which denotes the specialization of info...
ENTCS
2007
13 years 10 months ago
2007
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
JCO
2007
13 years 10 months ago
2007
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
ICCV
2001
IEEE
14 years 12 months ago
2001
IEEE
In a known environment, objects may be tracked in multiple views using a set of background models. Stereo-based models can be illumination-invariant, but often have undefined valu...