9842 search results - page 1651 / 1969 » The Complexity of the Matching-Cut Problem |
179
click to vote
SEFM
2003
IEEE
15 years 12 months ago
2003
IEEE
Despite the advances in software engineering since 1968, current methods for going from a set of functional requirements to a design are not as direct, repeatable and constructive...
169
click to vote
CASES
2003
ACM
15 years 12 months ago
2003
ACM
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
166
Voted
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
We introduce anisotropic Voronoi diagrams, a generalization of multiplicatively weighted Voronoi diagrams suitable for generating guaranteed-quality meshes of domains in which lon...
160
click to vote
SIGECOM
2003
ACM
15 years 12 months ago
2003
ACM
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
163
click to vote
APWEB
2003
Springer
15 years 12 months ago
2003
Springer
Routing strategy is one of the most important aspects in a mobile agent system, which is a complex combinatorial problem. Most of current mobile agent systems adopt static routing ...