Sciweavers

4047 search results - page 203 / 810
» The Discrete Basis Problem
Sort
View
137
Voted
ICTAI
2010
IEEE
15 years 1 months ago
Combining Mixed Integer Programming and Supervised Learning for Fast Re-planning
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
Emmanuel Rachelson, Ala Ben Abbes, Sebastien Dieme...
SEMWEB
2010
Springer
15 years 1 months ago
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet
124
Voted
KRDB
1994
78views Database» more  KRDB 1994»
15 years 4 months ago
The Problems of Data Modeling in Software Practice
This paper presents, fromthe author's perspective, the problems that occur in practice during data modelling. The author's experiences are a result of a considerable num...
Harald Huber
142
Voted
ICRA
2002
IEEE
121views Robotics» more  ICRA 2002»
15 years 8 months ago
An Efficient Approach to the Simultaneous Localisation and Mapping Problem
—The simultaneous localization and map building (SLAM) problem asks if it is possible for an autonomous vehicle to start in an unknown location in an unknown environment and then...
Stefan B. Williams, Gamini Dissanayake, Hugh F. Du...
AAAI
2000
15 years 4 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith