4066 search results - page 556 / 814 » Almost Complete Sets |
211
click to vote
MATES
2009
Springer
16 years 1 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
184
click to vote
MODELS
2009
Springer
16 years 1 months ago
2009
Springer
The proliferation of smart spaces and emergence of new standards, such as Web Services, have paved the way for a new breed of software systems. Often the complete functional and Qo...
186
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
Recent work has shown the value of using unsatisfiable cores to guide maximum satisfiability algorithms (Max-SAT) running on industrial instances [5,9,10,11]. We take this concep...
201
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Ontology matching plays a key role for semantic interoperability. Many methods have been proposed for automatically finding the alignment between heterogeneous ontologies. However...
162
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
— 1In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of pl...