2612 search results - page 166 / 523 » Switching Graphs and Their Complexity |
121
click to vote
AUTOMATICA
2008
15 years 1 months ago
2008
In this paper we study averaging algorithms and coverage control laws in a unified light. First, we characterize the convergence properties of averaging algorithms over acyclic di...
113
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
— 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....
AML
2005
15 years 28 days ago
2005
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
125
Voted
DC
2002
15 years 25 days ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
125
Voted
JSA
2008
15 years 16 days ago
2008
We present a framework for the formal verification of abstract state machine (ASM) designs using the multiway decision graphs (MDG) tool. ASM is a state based language for describ...