113 search results - page 15 / 23 » On bounded occurrence constraint satisfaction |
IWPC
2000
IEEE
14 years 17 hour ago
2000
IEEE
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...
SODA
2010
ACM
13 years 6 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
ICASSP
2009
IEEE
13 years 5 months ago
2009
IEEE
We consider a broadcast channel with multiple antennas at the base station and single-antenna receivers, and we study transceiver design with Quality of Service (QoS) requirements...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
AAAI
2007
13 years 10 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...