125 search results - page 6 / 25 » N Semantic Classes are Harder than Two |
CSC
2006
15 years 1 months ago
2006
An addition chain for a natural number n is a sequence 1 = a0 < a1 < . . . < ar = n of numbers such that for each 0 < i r, ai = aj + ak for some 0 k j < i. Thurbe...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...
112
click to vote
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
MHCI
2004
Springer
15 years 5 months ago
2004
Springer
The study reported here investigates the design and evaluation of a gesturecontrolled, spatially-arranged auditory user interface for a mobile computer. Such an interface may prov...
94
Voted
CORR
2002
Springer
14 years 11 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...