Sciweavers

153 search results - page 11 / 31
» Ibis: Real-world problem solving using real-world grids
Sort
View
ECML
2005
Springer
14 years 1 months ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
EVOW
2007
Springer
14 years 1 months ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
ENDM
2010
101views more  ENDM 2010»
13 years 7 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
ENGL
2008
113views more  ENGL 2008»
13 years 7 months ago
Intelligent Decision Support for Evaluating and Selecting Information Systems Projects
This paper presents an intelligent decision support system (DSS) for facilitating the adoption of the most appropriate multicriteria analysis (MA) method in solving the information...
Hepu Deng, Santoso Wibowo
SARA
2005
Springer
14 years 1 months ago
Synthesizing Plans for Multiple Domains
Intelligent agents acting in real world environments need to synthesize their course of action based on multiple sources of knowledge. They also need to generate plans that smoothl...
Abdelbaki Bouguerra, Lars Karlsson