Sciweavers

98 search results - page 9 / 20
» Complexity of the traveling tournament problem
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 8 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
EMO
2009
Springer
235views Optimization» more  EMO 2009»
14 years 2 months ago
Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
Abel Garcia-Najera, John A. Bullinaria
WORDS
2003
IEEE
14 years 24 days ago
Using Co-ordinated Atomic Actions for Building Complex Web Applications: A Learning Experience
This paper discusses some of the typical characteristics of modern Web applications and analyses some of the problems the developers of such systems have to face. One of such type...
Avelino F. Zorzo, Panayiotis Periorellis, Alexande...
AIR
2010
96views more  AIR 2010»
13 years 7 months ago
Logic programming for combinatorial problems
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
Toshinori Munakata, Roman Barták
ICRA
2010
IEEE
119views Robotics» more  ICRA 2010»
13 years 6 months ago
Evader surveillance under incomplete information
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...
Israel Becerra, Rafael Murrieta-Cid, Raul Monroy