Sciweavers

54 search results - page 4 / 11
» No-commitment branch and bound search for distributed constr...
Sort
View
VLSID
2006
IEEE
112views VLSI» more  VLSID 2006»
14 years 8 days ago
Handling Constraints in Multi-Objective GA for Embedded System Design
Design space exploration is central to embedded system design. Typically this is a multi-objective search problem, where performance, power, area etc. are the different optimizati...
Biman Chakraborty, Ting Chen, Tulika Mitra, Abhik ...
CP
1997
Springer
13 years 10 months ago
Distributed Partial Constraint Satisfaction Problem
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
Katsutoshi Hirayama, Makoto Yokoo
IWPC
2000
IEEE
13 years 10 months ago
A Pattern Matching Framework for Software Architecture Recovery and Restructuring
This paper presents a framework for software architecture recovery and restructuring. The user specifies a high level abstraction view of the system using a structured pattern la...
Kamran Sartipi, Kostas Kontogiannis, Farhad Mavadd...
SPIESR
1997
97views Database» more  SPIESR 1997»
13 years 7 months ago
Multiscale Branch-and-Bound Image Database Search
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
Jau-Yuen Chen, Charles A. Bouman, Jan P. Allebach
ATAL
2010
Springer
13 years 7 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...