2446 search results - page 186 / 490 » Choiceless Polynomial Time |
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
CAI
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
CIA
2007
Springer
14 years 2 months ago
2007
Springer
Coalitions are often required for multi-agent collaboration. In this research, we consider tasks that can only be completed with the combined efforts of multiple agents using appro...
CP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric soluti...
CSCLP
2007
Springer
14 years 2 months ago
2007
Springer
Temporal networks play a crucial role in modeling temporal relations in planning and scheduling applications. Temporal Networks with Alternatives (TNAs) were proposed to model alte...