Sciweavers

1368 search results - page 6 / 274
» Perfect Local Computability and Computable Simulations
Sort
View
73
Voted
E2EMON
2006
IEEE
15 years 3 months ago
Active Probing Approach for Fault Localization in Computer Networks
—Active probing is an active network monitoring technique that has potential for developing effective solutions for fault localization. In this paper we use active probing to pre...
Maitreya Natu, Adarshpal S. Sethi
NAR
2008
73views more  NAR 2008»
14 years 9 months ago
LocalMove: computing on-lattice fits for biopolymers
Given an input Protein Data Bank file (PDB) for a protein or RNA molecule, LocalMove is a web server that determines an on-lattice representation for the input biomolecule. The we...
Yann Ponty, R. Istrate, E. Porcelli, Peter Clote
120
Voted
ICDCS
1996
IEEE
15 years 1 months ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
Babak Hamidzadeh, David J. Lilja
57
Voted
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
15 years 3 months ago
On the Theory of Matchgate Computations
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu
75
Voted
CIE
2005
Springer
15 years 3 months ago
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...
Jérôme Durand-Lose