Sciweavers

2266 search results - page 146 / 454
» Some Solutions to the Ignoring Problem
Sort
View
ICRA
1993
IEEE
142views Robotics» more  ICRA 1993»
15 years 10 months ago
Avoiding the Past: A Simple but Effective Strategy for Reactive Navigation
An issue central to the navigation problem is memory. Traditional systems build symbolic maps of the world for navigational reference. Reactive methods, in contrast, eliminate or m...
Tucker R. Balch, Ronald C. Arkin
AAAI
1994
15 years 7 months ago
Dead-End Driven Learning
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
Daniel Frost, Rina Dechter
CSC
2009
15 years 7 months ago
An Empirical Analysis of Approximation Algorithms for Euclidean TSP
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
Bárbara Rodeker, M. Virginia Cifuentes, Lil...
EOR
2008
75views more  EOR 2008»
15 years 6 months ago
GRASP and path relinking for project scheduling under partially renewable resources
Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and...
Ramón Alvarez-Valdés, Enric Crespo, ...
ICDM
2009
IEEE
142views Data Mining» more  ICDM 2009»
15 years 4 months ago
Building Classifiers with Independency Constraints
In this paper we study the problem of classifier learning where the input data contains unjustified dependencies between some data attributes and the class label. Such cases arise...
Toon Calders, Faisal Kamiran, Mykola Pechenizkiy