Sciweavers

2534 search results - page 496 / 507
» A Type System for the Push-Enter Model
Sort
View
RANDOM
1998
Springer
13 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
AFRIGRAPH
2010
ACM
13 years 11 months ago
Visualization of solution sets from automated docking of molecular structures
Aligning structures, often referred to as docking or registration, is frequently required in fields such as computer science, robotics and structural biology. The task of alignin...
Johannes Jansen van Vuuren, Michelle Kuttel, James...
SIGIR
2010
ACM
13 years 11 months ago
Entity information management in complex networks
Entity information management (EIM) is a nascent IR research area that investigates the information management process about entities instead of documents. It is motivated by the ...
Yi Fang
RTSS
2000
IEEE
13 years 11 months ago
Efficient Scheduling of Sporadic, Aperiodic, and Periodic Tasks with Complex Constraints
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...
Damir Isovic, Gerhard Fohler
ICDCS
1995
IEEE
13 years 11 months ago
Specifying Weak Sets
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
Jeannette M. Wing, David C. Steere