Sciweavers

2917 search results - page 365 / 584
» Satisfying Interaction Constraints
Sort
View
ICCBR
2010
Springer
15 years 10 months ago
Goal-Driven Autonomy with Case-Based Reasoning
The vast majority of research on AI planning has focused on automated plan recognition, in which a planning agent is provided with a set of inputs that include an initial goal (or ...
Héctor Muñoz-Avila, Ulit Jaidee, Dav...
DAC
2009
ACM
15 years 10 months ago
RegPlace: a high quality open-source placement framework for structured ASICs
Structured ASICs have recently emerged as an exciting alternative to ASIC or FPGA design style as they provide a new trade-off between the high performance of ASIC design and low ...
Ashutosh Chakraborty, Anurag Kumar, David Z. Pan
GLOBECOM
2007
IEEE
15 years 10 months ago
mQMA: Multi-Constrained QoS Multicast Aggregation
Traditional IP Multicast has been proposed in order to manage group communications over the Internet in a bandwidth efficient manner. Although this proposition has been well studie...
Naouel Ben Ali, Joanna Moulierac, Abdelfattah Belg...
APNOMS
2006
Springer
15 years 10 months ago
Information-Driven Task Routing for Network Management in Wireless Sensor Networks
Wireless sensor networks (WSNs) consist of a large collection of small nodes providing collaborative and distributed sensing ability in unpredictable environments. Given their unat...
Yu Liu, Yumei Wang, Lin Zhang, Chan-Hyun Youn
ATAL
2006
Springer
15 years 10 months ago
Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
Katsutoshi Hirayama