Sciweavers

2799 search results - page 380 / 560
» computing 1998
Sort
View
CORR
1998
Springer
106views Education» more  CORR 1998»
15 years 4 months ago
Lower Bounds for Quantum Search and Derandomization
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In par...
Harry Buhrman, Ronald de Wolf
MP
1998
73views more  MP 1998»
15 years 4 months ago
On proving existence of feasible points in equality constrained optimization problems
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
R. Baker Kearfott
TON
1998
87views more  TON 1998»
15 years 4 months ago
Adaptive hybrid clock discipline algorithm for the network time protocol
This paper describes the analysis, implementation and performance of a new algorithm engineered to discipline a computer clock to a source of standard time, such as a GPS receiver...
David L. Mills
DIGITALCITIES
2003
Springer
15 years 10 months ago
Activities and Technologies in Digital City Kyoto
We have developed a digital city for Kyoto, the old capital and cultural center of Japan, as a social information infrastructure for urban everyday life including shopping, busines...
Toru Ishida
NC
2008
15 years 4 months ago
How crystals that sense and respond to their environments could evolve
An enduring mystery in biology is how a physical entity simple enough to have arisen spontaneously could have evolved into the complex life seen on Earth today. Cairns-Smith has pr...
Rebecca Schulman, Erik Winfree