Sciweavers

1984 search results - page 145 / 397
» Variable mesh optimization for continuous optimization probl...
Sort
View
CP
2007
Springer
16 years 14 days ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
NIPS
2007
15 years 7 months ago
Discriminative Batch Mode Active Learning
Active learning sequentially selects unlabeled instances to label with the goal of reducing the effort needed to learn a good classifier. Most previous studies in active learning...
Yuhong Guo, Dale Schuurmans
173
Voted
CDC
2010
IEEE
150views Control Systems» more  CDC 2010»
15 years 1 months ago
Nonlinear hybrid system identification with kernel models
Abstract-- This paper focuses on the identification of nonlinear hybrid systems involving unknown nonlinear dynamics. The proposed method extends the framework of [1] by introducin...
Fabien Lauer, Gérard Bloch, René Vid...
GLOBECOM
2008
IEEE
15 years 6 months ago
Many-to-Many Traffic Grooming in WDM Mesh Networks
In many-to-many communication, a session consists of group of users (we call them members) where each one of the members transmits its traffic to all other members in the group. Th...
Mohammad A. Saleh, Ahmed E. Kamal
FOCS
2004
IEEE
15 years 10 months ago
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
Brian C. Dean, Michel X. Goemans, Jan Vondrá...