Sciweavers

3049 search results - page 273 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
TKDE
2008
115views more  TKDE 2008»
15 years 6 months ago
A Niching Memetic Algorithm for Simultaneous Clustering and Feature Selection
Clustering is inherently a difficult task and is made even more difficult when the selection of relevant features is also an issue. In this paper, we propose an approach for simult...
Weiguo Sheng, Xiaohui Liu, Michael C. Fairhurst
ICCAD
2005
IEEE
132views Hardware» more  ICCAD 2005»
16 years 6 days ago
Battery optimization vs energy optimization: which to choose and when?
— Batteries are non-ideal energy sources – minimizing the energy consumption of a battery-powered system is not equivalent to maximizing its battery life. We propose an alterna...
Ravishankar Rao, Sarma B. K. Vrudhula
INFOCOM
2012
IEEE
13 years 9 months ago
A simpler and better design of error estimating coding
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
Nan Hua, Ashwin Lall, Baochun Li, Jun Xu
ATAL
2006
Springer
15 years 10 months ago
Learning the task allocation game
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
Sherief Abdallah, Victor R. Lesser
ISAAC
2005
Springer
131views Algorithms» more  ISAAC 2005»
16 years 3 days ago
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
Xiao Zhou, Takao Nishizeki