9532 search results - page 1659 / 1907 » Logic, Graphs, and Algorithms |
180
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
184
click to vote
ISPD
2000
ACM
15 years 11 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
171
click to vote
ECAI
1998
Springer
15 years 10 months ago
1998
Springer
Abstract: Lazy computation is not new in model-based diagnosis of active systems (and of discreteevent systems in general). Up to a decade ago, diagnosis methods for discrete-event...
233
click to vote
WOSP
1998
ACM
15 years 10 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
202
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...