Sciweavers

1511 search results - page 125 / 303
» Randomness, lowness and degrees
Sort
View
SAT
2007
Springer
81views Hardware» more  SAT 2007»
16 years 14 days ago
Short XORs for Model Counting: From Theory to Practice
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
CEC
2005
IEEE
15 years 12 months ago
Genetic algorithms with self-organized criticality for dynamic optimization problems
This paper proposes a genetic algorithm (GA) with random immigrants for dynamic optimization problems where the worst individual and its neighbours are replaced every generation. I...
Renato Tinós, Shengxiang Yang
MOBICOM
2004
ACM
15 years 11 months ago
Vehicle-to-vehicle safety messaging in DSRC
— This paper studies the design of layer-2 protocols for a vehicle to send safety messages to other vehicles. The target is to send vehicle safety messages with high reliability ...
Qing Xu 0007, Tony K. Mak, Jeff Ko, Raja Sengupta
WABI
2001
Springer
15 years 10 months ago
The Performance of Phylogenetic Methods on Trees of Bounded Diameter
We study the convergence rates of neighbor-joining and several new phylogenetic reconstruction methods on families of trees of bounded diameter. Our study presents theoretically ob...
Luay Nakhleh, Usman Roshan, Katherine St. John, Je...
INFOCOM
2000
IEEE
15 years 10 months ago
Blocking in All-Optical Networks
— We present a new analytical technique, based on the inclusion–exclusion principle from combinatorics, for the analysis of all-optical networks with no wavelength conversion a...
Ashwin Sridharan, Kumar N. Sivarajan