Sciweavers

549 search results - page 100 / 110
» Constraint Programming in Structural Bioinformatics
Sort
View
120
Voted
IFIP
2004
Springer
15 years 5 months ago
Solving Packing Problem with Weaker Block Solvers
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...
Hu Zhang
95
Voted
CP
2003
Springer
15 years 5 months ago
CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
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...
Alessio Guerri, Michela Milano
107
Voted
AGENTS
2001
Springer
15 years 4 months ago
Automated negotiation from declarative contract descriptions
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...
Daniel M. Reeves, Michael P. Wellman, Benjamin N. ...
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
15 years 4 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang
ASAP
2010
IEEE
148views Hardware» more  ASAP 2010»
15 years 1 months ago
Function flattening for lease-based, information-leak-free systems
Recent research has proposed security-critical real-time embedded systems with provably-strong information containment through the use of hardware-enforced execution leases. Execut...
Xun Li, Mohit Tiwari, Timothy Sherwood, Frederic T...