Sciweavers

1192 search results - page 42 / 239
» Computing Weakest Readings
Sort
View
FSTTCS
2004
Springer
15 years 5 months ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
INFOVIS
2003
IEEE
15 years 5 months ago
Multiscale Visualization of Small World Networks
Many networks under study in Information Visualization are “small world” networks. These networks first appeared in the study social networks and were shown to be relevant mod...
David Auber, Yves Chiricota, Fabien Jourdan, Guy M...
DSN
2002
IEEE
15 years 4 months ago
A Realistic Look At Failure Detectors
This paper shows that, in an environment where we do not bound the number of faulty processes, the class P of Perfect failure detectors is the weakest (among realistic failure det...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
AGP
1997
IEEE
15 years 4 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
CLUSTER
2007
IEEE
14 years 11 months ago
Meta-communications in component-based communication frameworks for grids
— Applications are faced with several network-related problems on current grids: heterogeneous networks, firewalls, NAT, private IP addresses, non-routed networks, performance p...
Alexandre Denis