Sciweavers

3008 search results - page 545 / 602
» Independence in connected graphs
Sort
View
INTERNET
2007
105views more  INTERNET 2007»
15 years 6 months ago
Workflow Planning on a Grid
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
Craig W. Thompson, Wing Ning Li, Zhichun Xiao
VLDB
2002
ACM
264views Database» more  VLDB 2002»
15 years 6 months ago
Viator - A Tool Family for Graphical Networking and Data View Creation
Web-based data sources, particularly in Life Sciences, grow in diversity and volume. Most of the data collections are equipped with common document search, hyperlink and retrieval...
Stephan Heymann, Katja Tham, Axel Kilian, Gunnar W...
GLOBECOM
2010
IEEE
15 years 4 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
15 years 4 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
COMPGEOM
2011
ACM
14 years 10 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner