71228 search results - page 13785 / 14246 » Algorithms |
185
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
184
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
180
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
208
click to vote
CIVR
2010
Springer
15 years 10 months ago
2010
Springer
One of the main challenges in interactive concept-based video search is the insufficient relevant sample problem, especially for queries with complex semantics. To address this pr...
178
click to vote
CLEF
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we will describe Berkeley's approach to the Domain Specific (DS) track for CLEF 2006. This year we are not using the tools for thesaurus-based query expansion a...