2725 search results - page 506 / 545 » Constraint Solving for Interpolation |
SIAMSC
2008
15 years 20 days ago
2008
We develop a computational method for simulating models of gel dynamics where the gel is described by two phases, a networked polymer and a fluid solvent. The models consist of tra...
101
click to vote
TASE
2008
IEEE
15 years 20 days ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
CN
2004
15 years 18 days ago
2004
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
98
Voted
CMOT
2000
15 years 17 days ago
2000
This paper reports on the development of a comprehensive framework for the analysis and formulation of bids in competitive electricity markets. Competing entities submit offers of...
116
Voted
MP
2002
15 years 12 days ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...