Sciweavers

982 search results - page 97 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
JMLR
2006
125views more  JMLR 2006»
15 years 4 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
CDC
2010
IEEE
152views Control Systems» more  CDC 2010»
14 years 11 months ago
Optimal network topology design in multi-agent systems for efficient average consensus
The problem considered in the present article is optimal design of network topologies in multi-agent systems in order to make communication on the network as efficient as possible ...
Mohammad Rafiee, Alexandre M. Bayen
HEURISTICS
2010
14 years 11 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
DISOPT
2008
93views more  DISOPT 2008»
15 years 4 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson
SGP
2007
15 years 7 months ago
Voronoi-based variational reconstruction of unoriented point sets
We introduce an algorithm for reconstructing watertight surfaces from unoriented point sets. Using the Voronoi diagram of the input point set, we deduce a tensor field whose princ...
Pierre Alliez, David Cohen-Steiner, Yiying Tong, M...