Sciweavers

810 search results - page 121 / 162
» Solving Time-Dependent Planning Problems
Sort
View
OL
2010
128views more  OL 2010»
13 years 6 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...
WSC
2000
13 years 9 months ago
Using simulation and critical points to define states in continuous search spaces
Many artificial intelligence techniques rely on the notion ate" as an abstraction of the actual state of the nd an "operator" as an abstraction of the actions that ...
Marc S. Atkin, Paul R. Cohen
FUIN
2006
98views more  FUIN 2006»
13 years 8 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
TVCG
2011
120views more  TVCG 2011»
13 years 2 months ago
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
Martin Nöllenburg, Alexander Wolff
LAMAS
2005
Springer
14 years 1 months ago
Multi-agent Relational Reinforcement Learning
In this paper we report on using a relational state space in multi-agent reinforcement learning. There is growing evidence in the Reinforcement Learning research community that a r...
Tom Croonenborghs, Karl Tuyls, Jan Ramon, Maurice ...