2435 search results - page 462 / 487 » Question Answering in Webclopedia |
104
click to vote
JUCS
2007
14 years 9 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
APAL
2002
14 years 9 months ago
2002
Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classe...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
CPHYSICS
2004
14 years 9 months ago
2004
There has been dramatic progress in the scope and power of plasma simulations in recent years; and because codes are generally cheaper to write, to run and to diagnose than experi...
COMPUTER
2000
14 years 9 months ago
2000
hysical world. How do you adapt software abstractions designed merely to transform data to meet requirements like real-time constraints, concurrency, and stringent safety considera...