3356 search results - page 373 / 672 » Computing education for sustainability |
182
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
190
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
167
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
179
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of...
213
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...