Sciweavers

417 search results - page 76 / 84
» In Search of the Best Constraint Satisfaction Search
Sort
View
RTS
2006
132views more  RTS 2006»
14 years 9 months ago
A framework for modular analysis and exploration of heterogeneous embedded systems
Abstract The increasing complexity of heterogeneous systems-on-chip, SoC, and distributed embedded systems makes system optimization and exploration a challenging task. Ideally, a ...
Arne Hamann, Marek Jersak, Kai Richter, Rolf Ernst
JAIR
2007
111views more  JAIR 2007»
14 years 9 months ago
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
J. Christopher Beck, Nic Wilson
DAC
2002
ACM
15 years 10 months ago
TCG-S: orthogonal coupling of P*-admissible representations for general floorplans
We extend in this paper the concept of the P-admissible floorplan representation to that of the P*-admissible one. A P*-admissible representation can model the most general floorp...
Jai-Ming Lin, Yao-Wen Chang
PETRA
2009
ACM
15 years 4 months ago
Automatic sensor placement in a 3D volume
Given a 3D environment, a set of constraints, and a set of sensor models, this paper addresses the problem of finding the set of sensors and their corresponding placement that cov...
Eric Becker, Gutemberg Guerra-Filho, Fillia Makedo...
IAT
2010
IEEE
14 years 7 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler