Sciweavers

89 search results - page 16 / 18
» Abstraction Heuristics Extended with Counting Abstractions
Sort
View
MMB
2012
Springer
259views Communications» more  MMB 2012»
13 years 5 months ago
Boosting Design Space Explorations with Existing or Automatically Learned Knowledge
Abstract. During development, processor architectures can be tuned and configured by many different parameters. For benchmarking, automatic design space explorations (DSEs) with h...
Ralf Jahr, Horia Calborean, Lucian Vintan, Theo Un...
VLDB
2005
ACM
109views Database» more  VLDB 2005»
15 years 9 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
ICRA
2008
IEEE
167views Robotics» more  ICRA 2008»
15 years 4 months ago
An approximate algorithm for solving oracular POMDPs
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
Nicholas Armstrong-Crews, Manuela M. Veloso
127
Voted
INFOCOM
2007
IEEE
15 years 3 months ago
Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks
Abstract— We consider a scenario where a sophisticated jammer jams an area in a single-channel wireless sensor network. The jammer controls the probability of jamming and transmi...
Mingyan Li, Iordanis Koutsopoulos, Radha Poovendra...
BTW
2007
Springer
136views Database» more  BTW 2007»
15 years 3 months ago
System P: Completeness-driven Query Answering in Peer Data Management Systems
Abstract: Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers...
Armin Roth, Felix Naumann