Sciweavers

19700 search results - page 109 / 3940
» DNA-Based Computation Times
Sort
View
FUIN
2000
68views more  FUIN 2000»
14 years 9 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
AIM
1998
14 years 9 months ago
Computer Bridge - A Big Win for AI Planning
A computer program that uses AI planning techniques is now the world’s best program for the game of contract bridge. As reported in The New York Times and The Washington Post, t...
Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop
GIS
2010
ACM
14 years 8 months ago
A case for time-dependent shortest path computation in spatial networks
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
ICMS
2010
14 years 8 months ago
The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
There is a growing interest in numeric-algebraic techniques in the computer algebra community as such techniques can speed up many applications. This paper is concerned with one su...
Jihun Yu, Chee Yap, Zilin Du, Sylvain Pion, Herv&e...
WIAS
2010
102views more  WIAS 2010»
14 years 8 months ago
Information security underlying transparent computing: Impacts, visions and challenges
The rapid development of computer network technologies and social informationalization has brought many new opportunities and challenges in information security. With improved info...
Yaoxue Zhang, Laurence Tianruo Yang, Yuezhi Zhou, ...