3946 search results - page 582 / 790 » The computational complexity of choice sets |
145
click to vote
AGILE
2007
Springer
16 years 25 days ago
2007
Springer
Using qualitative reasoning with geographic information, contrarily, for instance, with robotics, looks not only fastidious (i.e.: encoding knowledge Propositional Logics PL), but ...
153
click to vote
CAV
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
199
click to vote
CSR
2007
Springer
16 years 24 days ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
169
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...
168
click to vote
MDM
2007
Springer
16 years 23 days ago
2007
Springer
The engineering community has recently begun to adopt wireless sensing technologies for use in many sensing applications. These low-cost sensors provide an optimal setting for den...