Sciweavers

484 search results - page 31 / 97
» The number of convex permutominoes
Sort
View
CIS
2005
Springer
14 years 3 months ago
Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning
⎯A new nonslicing floorplan representation, the moving block sequence (MBS), is proposed in this paper. Our idea of the MBS originates from the observation that placing blocks on...
Jing Liu, Weicai Zhong, Licheng Jiao
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
14 years 2 months ago
Geometric Spanners for Weighted Point Sets
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
CDC
2010
IEEE
215views Control Systems» more  CDC 2010»
13 years 5 months ago
Consensus with robustness to outliers via distributed optimization
Over the past few years, a number of distributed algorithms have been developed for integrating the measurements acquired by a wireless sensor network. Among them, average consensu...
Jixin Li, Ehsan Elhamifar, I.-Jeng Wang, Ren&eacut...
JCT
2011
84views more  JCT 2011»
13 years 5 months ago
Enumerating isodiametric and isoperimetric polygons
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
Michael J. Mossinghoff
JMLR
2012
12 years 16 days ago
Beyond Logarithmic Bounds in Online Learning
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...