Sciweavers

396 search results - page 60 / 80
» Exact Algorithms for Graph Homomorphisms
Sort
View
SAC
2005
ACM
14 years 2 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
DCOSS
2006
Springer
14 years 20 days ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
EUROCAST
2007
Springer
159views Hardware» more  EUROCAST 2007»
14 years 27 days ago
Ant Colony Optimization for Model Checking
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
Enrique Alba, J. Francisco Chicano
IPSN
2009
Springer
14 years 3 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 3 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz