Sciweavers

16596 search results - page 439 / 3320
» Generalized Assignment Problems
Sort
View
AAAI
2006
15 years 9 months ago
Multimodal Cognitive Architecture: Making Perception More Central to Intelligent Behavior
I propose that the notion of cognitive state be broadened from the current predicate-symbolic, Language-of-Thought framework to a multi-modal one, where perception and kinesthetic...
B. Chandrasekaran
DAC
2010
ACM
15 years 8 months ago
Detecting tangled logic structures in VLSI netlists
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
Tanuj Jindal, Charles J. Alpert, Jiang Hu, Zhuo Li...
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
15 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
EJC
2008
15 years 7 months ago
Fractional coloring and the odd Hadwiger's conjecture
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
Ken-ichi Kawarabayashi, Bruce A. Reed
MST
2006
136views more  MST 2006»
15 years 7 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl