Sciweavers

162 search results - page 21 / 33
» Study of Lower Bound Functions for MAX-2-SAT
Sort
View
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
15 years 4 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 2 months ago
Preemptive Online Scheduling with Reordering
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
György Dósa, Leah Epstein
TCS
2008
14 years 9 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev
TWC
2008
101views more  TWC 2008»
14 years 9 months ago
Interplay of spectral efficiency, power and doppler spectrum for reference-signal-assisted wireless communication
Expressions relating spectral efficiency, power, and Doppler spectrum, are derived for Rayleigh-faded wireless channels with Gaussian signal transmission. No side information on th...
Angel Lozano
71
Voted
ICRA
1994
IEEE
111views Robotics» more  ICRA 1994»
15 years 1 months ago
From Spider Robots to Half Disk Robots
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...