113 search results - page 15 / 23 » On bounded occurrence constraint satisfaction |
114
click to vote
IWPC
2000
IEEE
15 years 6 months 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...
142
Voted
SODA
2010
ACM
15 years 4 days 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...
118
click to vote
ICASSP
2009
IEEE
14 years 11 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...
116
Voted
APPROX
2009
Springer
15 years 8 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...
135
click to vote
AAAI
2007
15 years 4 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 ...