Sciweavers

3758 search results - page 507 / 752
» A Complete Subsumption Algorithm
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 6 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
AOR
2006
95views more  AOR 2006»
15 years 6 months ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
SAC
2006
ACM
15 years 6 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
IFIPTCS
2010
15 years 4 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
WWW
2001
ACM
16 years 7 months ago
Efficient Acquisition of Web Data through Restricted Query Interfaces
A wealth of information is available on the Web. But often, such data are hidden behind form interfaces which allow only a restrictive set of queries over the underlying databases...
Cláudio T. Silva, Juliana Freire, Simon Bye...