549 search results - page 100 / 110 » Constraint Programming in Structural Bioinformatics |
133
click to vote
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
115
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
135
click to vote
AGENTS
2001
Springer
15 years 7 months ago
2001
Springer
We present and implement an infrastructure for automating the negotiation of business contracts. Underlying our system is a declarative language for both (1) fully-specified, exe...
136
click to vote
ICRA
1998
IEEE
15 years 7 months ago
1998
IEEE
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
122
click to vote
ASAP
2010
IEEE
15 years 4 months ago
2010
IEEE
Recent research has proposed security-critical real-time embedded systems with provably-strong information containment through the use of hardware-enforced execution leases. Execut...