1486 search results - page 110 / 298 » Algorithms for two-box covering |
169
click to vote
DATE
1999
IEEE
15 years 8 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
187
click to vote
KR
1994
Springer
15 years 8 months ago
1994
Springer
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
124
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
149
click to vote
CONSTRAINTS
2007
15 years 3 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
110
Voted
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...