Sciweavers

408 search results - page 52 / 82
» A lookahead strategy for solving large planning problems
Sort
View
C3S2E
2010
ACM
14 years 10 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
OL
2010
128views more  OL 2010»
14 years 8 months ago
A biased random-key genetic algorithm for road congestion minimization
One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment proble...
Luciana S. Buriol, Michael J. Hirsch, Panos M. Par...
94
Voted
ATMOS
2010
128views Optimization» more  ATMOS 2010»
14 years 8 months ago
Robust Train Routing and Online Re-scheduling
Train Routing is a problem that arises in the early phase of the passenger railway planning process, usually several months before operating the trains. The main goal is to assign...
Alberto Caprara, Laura Galli, Leo G. Kroon, G&aacu...
EDBT
2012
ACM
257views Database» more  EDBT 2012»
13 years 2 days ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
DEXA
2004
Springer
129views Database» more  DEXA 2004»
15 years 3 months ago
Using Case Based Retrieval Techniques for Handling Anomalous Situations in Advisory Dialogues
The efficacy of expert systems often depends on the accuracy and completeness of the problem specification negotiated with the user. Therefore, efficient user interfaces are needed...
Marcello L'Abbate, Ingo Frommholz, Ulrich Thiel, E...