16626 search results - page 208 / 3326 » Computing is a natural science |
176
click to vote
GI
2001
Springer
15 years 11 months ago
2001
Springer
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
159
click to vote
ACMSE
2008
ACM
15 years 8 months ago
2008
ACM
Using a problem domain motivated by Bentley's"Little Languages" column [1], this paper explores the use of the Ruby programming language's flexible syntax, dyn...
179
click to vote
KSEM
2010
Springer
15 years 4 months ago
2010
Springer
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
170
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
164
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— Selective data return leverages onboard data analysis to allocate limited bandwidth resources during remote exploration. Here we present an adaptive method to subsample image s...