2398 search results - page 241 / 480 » Constraint Programming and Graph Algorithms |
188
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
207
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
201
click to vote
ICPADS
1994
IEEE
15 years 10 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
185
click to vote
FCCM
2000
IEEE
15 years 11 months ago
2000
IEEE
Simplifying the programming models is paramount to the success of reconfigurable computing. We apply the principles of object-oriented programming to the design of stream archite...
184
click to vote
CCGRID
2010
IEEE
15 years 3 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...