Sciweavers

42738 search results - page 125 / 8548
» Search Computing Systems
Sort
View
TIT
2008
107views more  TIT 2008»
15 years 2 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 4 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
INTERACT
2003
15 years 4 months ago
In Search of Resonant Human Computer Interaction: Building and Testing Aesthetic Installations
: Resonance (Gibson, 1986) of users while interacting with a product should be a key issue in the development of human computer interaction. Because resonance requires developing o...
Caroline Hummels, Philip R. Ross, Kees Overbeeke
LAWEB
2008
IEEE
15 years 9 months ago
(Query) History Teaches Everything, Including the Future
“History Teaches Everything, Including the Future”, wrote Alphonse de Lamartine in the nineteen century. Even if history cannot be really considered a predictive science, hist...
Fabrizio Silvestri, Ranieri Baraglia, Claudio Lucc...
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
15 years 9 months ago
Computing Elevation Maxima by Searching the Gauss Sphere
The elevation function on a smoothly embedded 2-manifold in R3 reflects the multiscale topography of cavities and protrusions as local maxima. The function has been useful in iden...
Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov