Sciweavers

4865 search results - page 561 / 973
» The Complexity of Graph Connectivity
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
15 years 7 months ago
Encoding Distributed Process Calculi into LMNtal
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
Kazunori Ueda
147
Voted
CN
2006
98views more  CN 2006»
15 years 7 months ago
Internet resiliency to attacks and failures under BGP policy routing
We investigate the resiliency of the Internet at the Autonomous System (AS) level to failures and attacks, under the real constraint of business agreements between the ASs. The ag...
Danny Dolev, Sugih Jamin, Osnat Mokryn, Yuval Shav...
CORR
2007
Springer
108views Education» more  CORR 2007»
15 years 6 months ago
Scuba Search : when selection meets innovation
— We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality in fitness landscape....
Sébastien Vérel, Philippe Collard, M...
CORR
2007
Springer
76views Education» more  CORR 2007»
15 years 6 months ago
A Light-Based Device for Solving the Hamiltonian Path Problem
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...
Mihai Oltean
CORR
2007
Springer
93views Education» more  CORR 2007»
15 years 6 months ago
Solving the Hamiltonian path problem with a light-based computer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...
Mihai Oltean