Sciweavers

2827 search results - page 557 / 566
» Robustness of PSPACE-complete sets
Sort
View
JAIR
2008
104views more  JAIR 2008»
15 years 18 days ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes
117
Voted
COR
2007
163views more  COR 2007»
15 years 18 days ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
JCB
2008
159views more  JCB 2008»
15 years 18 days ago
BayesMD: Flexible Biological Modeling for Motif Discovery
We present BayesMD, a Bayesian Motif Discovery model with several new features. Three different types of biological a priori knowledge are built into the framework in a modular fa...
Man-Hung Eric Tang, Anders Krogh, Ole Winther
121
Voted
ISM
2006
IEEE
277views Multimedia» more  ISM 2006»
15 years 18 days ago
Efficient Bottom-Up Image Segmentation Using Region Competition and the Mumford-Shah Model for Color and Textured Images
Curve evolution implementations [3][23] [25] of the Mumford-Shah functional [16] are of broad interest in image segmentation. These implementations, however, have initialization p...
Yongsheng Pan, J. Douglas Birdwell, Seddik M. Djou...
127
Voted
JMLR
2008
159views more  JMLR 2008»
15 years 18 days ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin