Sciweavers

2200 search results - page 68 / 440
» Bloch's Constant is Computable
Sort
View
IWPEC
2004
Springer
15 years 3 months ago
Computing Small Search Numbers in Linear Time
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
Hans L. Bodlaender, Dimitrios M. Thilikos
WMCSA
2002
IEEE
15 years 2 months ago
Context Aggregation and Dissemination in Ubiquitous Computing Systems
Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...
Guanling Chen, David Kotz
ICRA
1993
IEEE
118views Robotics» more  ICRA 1993»
15 years 2 months ago
Mechanical Computation for Passive Force Control
Force control implemented by a passive mechanical device (perhaps a wrist) has inherent advantages over active implementations. A passive mechanical device can regain some of the ...
Ambarish Goswami, Michael A. Peshkin
FORMATS
2006
Springer
15 years 1 months ago
On the Computational Power of Timed Differentiable Petri Nets
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...
Serge Haddad, Laura Recalde, Manuel Silva
ESA
2010
Springer
170views Algorithms» more  ESA 2010»
14 years 11 months ago
Streaming Graph Computations with a Helpful Advisor
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
Graham Cormode, Michael Mitzenmacher, Justin Thale...