Sciweavers

1507 search results - page 298 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
MOBIHOC
2012
ACM
11 years 11 months ago
Serendipity: enabling remote computing among intermittently connected mobile devices
Mobile devices are increasingly being relied on for services that go beyond simple connectivity and require more complex processing. Fortunately, a mobile device encounters, possi...
Cong Shi, Vasileios Lakafosis, Mostafa H. Ammar, E...
SPAA
2009
ACM
14 years 3 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
INFOCOM
2007
IEEE
14 years 2 months ago
Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...
David Starobinski, Weiyao Xiao, Xiangping Qin, Ari...
ISPW
1996
IEEE
14 years 20 days ago
Feedback, evolution and software technology
A 1968 study of the software process led, inter alia, to the observation that the software process constitutes a feedback system. Attempts at its management and improvement must t...
M. M. Lehman
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 10 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti