Sciweavers

38 search results - page 5 / 8
» The Backdoor Key: A Path to Understanding Problem Hardness
Sort
View
IMC
2006
ACM
14 years 1 months ago
On the impact of research network based testbeds on wide-area experiments
An important stage of wide-area systems and networking research is to prototype a system to understand its performance when deployed in the real Internet. A key requirement of pro...
Himabindu Pucha, Y. Charlie Hu, Zhuoqing Morley Ma...
JSAC
2011
176views more  JSAC 2011»
13 years 2 months ago
Cross-Layer Routing Using Cooperative Transmission in Vehicular Ad-hoc Networks
Wireless vehicular ad hoc networks are characterized by multi-hop transmission, where a key problem is the design of routing, e.g., how to efficiently direct the information flo...
Zhiguo Ding, Kin K. Leung
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 7 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
PPSN
2010
Springer
13 years 6 months ago
Towards Analyzing Recombination Operators in Evolutionary Search
Recombination (also called crossover) operators are widely used in EAs to generate offspring solutions. Although the usefulness of recombination has been well recognized, theoretic...
Yang Yu, Chao Qian, Zhi-Hua Zhou
DAC
1999
ACM
14 years 8 months ago
Hypergraph Partitioning for VLSI CAD: Methodology for Heuristic Development, Experimentation and Reporting
We illustrate how technical contributions in the VLSI CAD partitioning literature can fail to provide one or more of: (i) reproducible results and descriptions, (ii) an enabling a...
Andrew E. Caldwell, Andrew B. Kahng, Andrew A. Ken...