Sciweavers

121 search results - page 9 / 25
» Random Assignment with Integer Costs
Sort
View
VLSID
2010
IEEE
211views VLSI» more  VLSID 2010»
13 years 11 months ago
A Combined DOE-ILP Based Power and Read Stability Optimization in Nano-CMOS SRAM
A novel design approach for simultaneous power and stability (static noise margin, SNM) optimization of nanoCMOS static random access memory (SRAM) is presented. A 45nm single-end...
Garima Thakral, Saraju P. Mohanty, Dhruva Ghai, Dh...
ICML
1994
IEEE
13 years 11 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
13 years 7 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
CN
2008
106views more  CN 2008»
13 years 6 months ago
Optimization models and methods for planning wireless mesh networks
In this paper novel optimization models are proposed for planning Wireless Mesh Networks (WMNs), where the objective is to minimize the network installation cost while providing f...
Edoardo Amaldi, Antonio Capone, Matteo Cesana, Ila...
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
14 years 2 months ago
Multi-robot routing with linear decreasing rewards over time
Abstract— We study multi-robot routing problems (MRLDR) where a team of robots has to visit a set of given targets with linear decreasing rewards over time, such as required for ...
Ali Ekici, Pinar Keskinocak, Sven Koenig