Sciweavers

3142 search results - page 392 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
WEA
2005
Springer
93views Algorithms» more  WEA 2005»
15 years 8 months ago
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eï¬...
Bram De Wachter, Alexandre Genon, Thierry Massart
NIPS
2003
15 years 4 months ago
An MDP-Based Approach to Online Mechanism Design
Online mechanism design (MD) considers the problem of providing incentives to implement desired system-wide outcomes in systems with self-interested agents that arrive and depart ...
David C. Parkes, Satinder P. Singh
COR
2008
95views more  COR 2008»
15 years 3 months ago
Good triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
Adam N. Letchford, Nicholas A. Pearson
ICPR
2008
IEEE
16 years 4 months ago
Training sequential on-line boosting classifier for visual tracking
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
Helmut Grabner, Horst Bischof, Jan Sochman, Jiri M...
GLOBECOM
2009
IEEE
15 years 9 months ago
Strong Barrier Coverage with Directional Sensors
Abstract—The barrier coverage model was proposed for applications in which sensors are deployed for intrusion detection. In this paper, we study a strong barrier coverage problem...
Li Zhang, Jian Tang, Weiyi Zhang