Sciweavers

2850 search results - page 378 / 570
» On Timed Models and Full Abstraction
Sort
View
PODC
2005
ACM
16 years 5 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
SIGUCCS
2003
ACM
15 years 12 months ago
Student staff: n. an energetic, brilliant, creative, talented potential rolled into a food-driven, sleep-deprived, unmotivated c
Students are a wonderful resource for any department of a college or university, especially an ITS department. They are inexpensive and abundant. They want to work at strange time...
Karen McRitchie
VR
2002
IEEE
125views Virtual Reality» more  VR 2002»
15 years 11 months ago
A Scalable, Multi-User VRML Server
VRML97 allows the description of dynamic worlds that can change with both the passage of time, and user interaction. Unfortunately, the current VRML usage model prevents its full ...
Thomas Rischbeck, Paul Watson
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 10 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
DAGSTUHL
2006
15 years 8 months ago
Pre-Routed FPGA Cores for Rapid System Construction in a Dynamic Reconfigurable System
This paper presents a method of constructing pre-routed FPGA cores which lays the foundations for a rapid system construction framework for dynamically reconfigurable computing sy...
Douglas L. Maskell, Timothy F. Oliver