Sciweavers

291 search results - page 45 / 59
» Implementation with a bounded action space
Sort
View
CP
2007
Springer
15 years 3 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
82
Voted
ATAL
2006
Springer
15 years 1 months ago
Continuous refinement of agent resource estimates
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
David N. Morley, Karen L. Myers, Neil Yorke-Smith
104
Voted
PAM
2012
Springer
13 years 5 months ago
OFLOPS: An Open Framework for OpenFlow Switch Evaluation
Recent efforts in software-defined networks, such as OpenFlow, give unprecedented access into the forwarding plane of networking equipment. When building a network based on OpenFl...
Charalampos Rotsos, Nadi Sarrar, Steve Uhlig, Rob ...
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
15 years 3 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
ISCAS
2006
IEEE
160views Hardware» more  ISCAS 2006»
15 years 3 months ago
Address-event image sensor network
We describe a sensor network based on smart requirements of the network. This will provide a new approach imager sensors able to extract events of interest from a scene. for compos...
Eugenio Culurciello, Andreas Savvides