Sciweavers

4229 search results - page 397 / 846
» On the Optimality of Spiral Search
Sort
View
CN
2007
148views more  CN 2007»
15 years 6 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel
TLT
2008
93views more  TLT 2008»
15 years 6 months ago
What Do You Prefer? Using Preferences to Enhance Learning Technology
While the growing number of learning resources increases the choice for learners on how, what and when to learn, it also makes it more and more difficult to find the learning resou...
Philipp Kärger, Daniel Olmedilla, Fabian Abel...
AMAI
1999
Springer
15 years 6 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
PPSN
2010
Springer
15 years 5 months ago
Improved Dynamic Lexicographic Ordering for Multi-Objective Optimisation
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...
Juan Pedro Castro Gutiérrez, Dario Landa-Si...
CPAIOR
2010
Springer
15 years 4 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey