683 search results - page 55 / 137 » A Fine-grained Analysis of a Simple Independent Set Algorith... |
123
Voted
CPC
2006
15 years 3 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
122
Voted
AAIM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorith...
144
Voted
IBPRIA
2007
Springer
15 years 10 months ago
2007
Springer
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
122
Voted
STOC
2002
ACM
16 years 4 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
115
Voted
TIME
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— We present a specification language and algorithms for the online and offline monitoring of synchronous systems including circuits and embedded systems. Such monitori...