Sciweavers

19130 search results - page 48 / 3826
» Modelling multi-path problems
Sort
View
124
Voted
EMNLP
2008
15 years 7 months ago
Attacking Decipherment Problems Optimally with Low-Order N-gram Models
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
Sujith Ravi, Kevin Knight
128
Voted
PPSN
2004
Springer
15 years 11 months ago
Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
Jano I. van Hemert, Johannes A. La Poutré
NETWORKS
2007
15 years 5 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
193
Voted
AAAI
2008
15 years 8 months ago
Physical Search Problems Applying Economic Search Models
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...
Yonatan Aumann, Noam Hazon, Sarit Kraus, David Sar...
124
Voted
CISS
2008
IEEE
16 years 25 days ago
Modelling multi-path problems
—In this paper we consider the behaviour of both primal and dual multi-path algorithms for a simple network of three resources. We examine the equilibrium behaviour of our models...
Richard J. Gibbens