Sciweavers

1001 search results - page 193 / 201
» A Recovery Algorithm for Reliable Multicasting in Reliable N...
Sort
View
ATAL
2008
Springer
13 years 9 months ago
No-regret learning and a mechanism for distributed multiagent planning
We develop a novel mechanism for coordinated, distributed multiagent planning. We consider problems stated as a collection of single-agent planning problems coupled by common soft...
Jan-P. Calliess, Geoffrey J. Gordon
TCAD
2008
128views more  TCAD 2008»
13 years 7 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...
COCOA
2009
Springer
14 years 9 days ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
DAC
2005
ACM
14 years 8 months ago
Fault and energy-aware communication mapping with guaranteed latency for applications implemented on NoC
As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival prob...
Sorin Manolache, Petru Eles, Zebo Peng
RAID
2009
Springer
14 years 2 months ago
PE-Miner: Mining Structural Information to Detect Malicious Executables in Realtime
In this paper, we present an accurate and realtime PE-Miner framework that automatically extracts distinguishing features from portable executables (PE) to detect zero-day (i.e. pr...
M. Zubair Shafiq, S. Momina Tabish, Fauzan Mirza, ...