Sciweavers

35419 search results - page 117 / 7084
» How are we doing
Sort
View
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 7 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
104
Voted
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 3 months ago
How to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
Anant Sahai
HOTNETS
2010
14 years 10 months ago
How to tell an airport from a home: techniques and applications
Today's Internet services increasingly use IP-based geolocation to specialize the content and service provisioning for each user. However, these systems focus almost exclusiv...
Andreas Pitsillidis, Yinglian Xie, Fang Yu, Mart&i...
HICSS
2011
IEEE
198views Biometrics» more  HICSS 2011»
14 years 7 months ago
Virtual Reality Meets Scrum: How a Senior Team Moved from Management to Leadership
The role of managers in a Scrum organization is a topic of high interest with almost no research. Changes in management roles and behaviors were evaluated in a rapidly growing, so...
Dina Friis, Jens Ostergaard, Jeff Sutherland
IJCAI
2003
15 years 5 months ago
On the Revision of Probabilistic Beliefs using Uncertain Evidence
We revisit the problem of revising probabilistic beliefs using uncertain evidence, and report results on four major issues relating to this problem: How to specify uncertain evide...
Hei Chan, Adnan Darwiche