Sciweavers

5448 search results - page 142 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
ICPP
2007
IEEE
15 years 10 months ago
Improving Static Task Scheduling in Heterogeneous and Homogeneous Computing Systems
In this paper, we present a heuristic algorithm that improves the performance of static task scheduling. Our algorithm is based on the list-scheduling mechanism. For the listing p...
Chih-Hsueh Yang, PeiZong Lee, Yeh-Ching Chung
ISWC
2000
IEEE
15 years 8 months ago
Finding Location Using Omnidirectional Video on a Wearable Computing Platform
In this paper we present a framework for a navigation system in an indoor environment using only omnidirectional video. Within a Bayesian framework we seek the appropriate place a...
Wasinee Rungsarityotin, Thad Starner
ADHOC
2008
122views more  ADHOC 2008»
15 years 4 months ago
Balancing computation and communication costs: The case for hybrid execution in sensor networks
Virtual machines (VM) are promising as system software in sensor networks. A major impediment to their widespread acceptance is their performance overhead. Compiling VM bytecode to...
Joel Koshy, Ingwar Wirjawan, Raju Pandey, Yann Ram...
ICDCS
2007
IEEE
15 years 10 months ago
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
COCOON
1999
Springer
15 years 8 months ago
Distributionally-Hard Languages
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
Lance Fortnow, Aduri Pavan, Alan L. Selman