Sciweavers

325 search results - page 29 / 65
» Remarks on the Schoof-Elkies-Atkin algorithm
Sort
View
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 5 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
GECCO
2006
Springer
201views Optimization» more  GECCO 2006»
15 years 5 months ago
Selective self-adaptive approach to ant system for solving unit commitment problem
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
Songsak Chusanapiputt, Dulyatat Nualhong, Sujate J...
DAGSTUHL
2001
15 years 2 months ago
Visualization for the Mind's Eye
Software visualization has been almost exclusively tackled from the visual point of view; this means visualization occurs exclusively through the visual channel. This approach has ...
Nelson A. Baloian, Wolfram Luther
CACM
2008
84views more  CACM 2008»
15 years 1 months ago
The emergence of a networking primitive in wireless sensor networks
The wireless sensor network community approached netabstractions as an open question, allowing answers to emerge with time and experience. The Trickle algorithm has become a basic...
Philip Levis, Eric A. Brewer, David E. Culler, Dav...
CC
2008
Springer
133views System Software» more  CC 2008»
15 years 1 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets