Sciweavers

390 search results - page 73 / 78
» Set Intersection Theorems and Existence of Optimal Solutions
Sort
View
OOPSLA
2009
Springer
14 years 2 months ago
Towards automation of iteration planning
Iterations are time-boxed periods with an intended outcome that is often a set of implemented requirements. Iterations are part of most common software development lifecycle model...
Jonas Helming, Maximilian Koegel, Zardosht Hodaie
OPODIS
2003
13 years 9 months ago
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,...
RECOMB
2004
Springer
14 years 8 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
MOBICOM
2009
ACM
14 years 2 months ago
Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has ...
Shuo Guo, Yu Gu, Bo Jiang, Tian He
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
14 years 2 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner