Sciweavers

240 search results - page 15 / 48
» Efficient Variants of the Backward-Oracle-Matching Algorithm
Sort
View
EVOW
2006
Springer
14 years 8 days ago
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
Yuichi Nagata
ECAI
2008
Springer
13 years 10 months ago
Theoretical Study of Ant-based Algorithms for Multi-Agent Patrolling
This paper addresses the multi-agent patrolling problem, which consists for a set of autonomous agents to visit all the places of an unknown environment as regularly as possible. T...
Arnaud Glad, Olivier Simonin, Olivier Buffet, Fran...
ICTAI
2008
IEEE
14 years 3 months ago
FIP: A Fast Planning-Graph-Based Iterative Planner
We present a fast iterative planner (FIP) that aims to handle planning problems involving nondeterministic actions. In contrast to existing iterative planners, FIP is built upon G...
Jicheng Fu, Farokh B. Bastani, Vincent Ng, I-Ling ...
CCR
1999
93views more  CCR 1999»
13 years 8 months ago
A RED discard strategy for ATM networks and its performance evaluation with TCP/IP traffic
In ATM UBR networks supporting TCP traffic, optimal efficiency can only be envisaged if switches adopt a discard mechanism that operates at the packet level rather than the cell l...
Vincent Rosolen, Olivier Bonaventure, Guy Leduc
ICML
2004
IEEE
14 years 9 months ago
Learning low dimensional predictive representations
Predictive state representations (PSRs) have recently been proposed as an alternative to partially observable Markov decision processes (POMDPs) for representing the state of a dy...
Matthew Rosencrantz, Geoffrey J. Gordon, Sebastian...