Sciweavers

3433 search results - page 371 / 687
» Heuristics for a bidding problem
Sort
View
ICIP
2010
IEEE
15 years 4 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...
CDC
2010
IEEE
181views Control Systems» more  CDC 2010»
15 years 1 months ago
Relationship between power loss and network topology in power systems
This paper is concerned with studying how the minimum power loss in a power system is related to its network topology. The existing algorithms in the literature all exploit nonline...
Javad Lavaei, Steven H. Low
AIPS
2011
14 years 10 months ago
Searching for Plans with Carefully Designed Probes
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
Nir Lipovetzky, Hector Geffner
DAC
2006
ACM
16 years 7 months ago
Optimality study of resource binding with multi-Vdds
Deploying multiple supply voltages (multi-Vdds) on one chip is an important technique to reduce dynamic power consumption. In this work we present an optimality study for resource...
Deming Chen, Jason Cong, Yiping Fan, Junjuan Xu
CPAIOR
2005
Springer
16 years 11 days ago
Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations
We describe the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne telescope. The problem requires maximizing the nu...
Jeremy Frank, Elif Kürklü