Sciweavers

6455 search results - page 319 / 1291
» Research problems
Sort
View
AI
2003
Springer
15 years 12 months ago
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
Dave A. D. Tompkins, Holger H. Hoos
PATAT
2000
Springer
123views Education» more  PATAT 2000»
15 years 10 months ago
A Multicriteria Approach to Examination Timetabling
The main aim of this paper is to consider university examination timetabling problems as multicriteria decision problems. A new multicriteria approach to solving such problems is p...
Edmund K. Burke, Yuri Bykov, Sanja Petrovic
DESRIST
2009
Springer
115views Education» more  DESRIST 2009»
15 years 10 months ago
Ontological design
In this paper, we describe the concept of ontological design. We show how ontologies can be used as cognitive maps of complex, ill-structured, plastic problems. They can be used t...
Arkalgud Ramaprasad, Sridhar S. Papagari
ATAL
2008
Springer
15 years 8 months ago
Optimized algorithms for multi-agent routing
Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to...
Akihiro Kishimoto, Nathan R. Sturtevant
CP
2008
Springer
15 years 8 months ago
Cost-Based Domain Filtering for Stochastic Constraint Programming
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
Roberto Rossi, Armagan Tarim, Brahim Hnich, Steven...