Sciweavers

9842 search results - page 1651 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
SEFM
2003
IEEE
15 years 12 months ago
From Requirements to Design: Formalizing the Key Steps
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...
R. Geoff Dromey
CASES
2003
ACM
15 years 12 months ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
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 ...
Federico Angiolini, Luca Benini, Alberto Caprara
166
Voted
COMPGEOM
2003
ACM
15 years 12 months ago
Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
We introduce anisotropic Voronoi diagrams, a generalization of multiplicatively weighted Voronoi diagrams suitable for generating guaranteed-quality meshes of domains in which lon...
François Labelle, Jonathan Richard Shewchuk
SIGECOM
2003
ACM
143views ECommerce» more  SIGECOM 2003»
15 years 12 months ago
Differential-revelation VCG mechanisms for combinatorial auctions
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...
Wolfram Conen, Tuomas Sandholm
APWEB
2003
Springer
15 years 12 months ago
An Ant Algorithm Based Dynamic Routing Strategy for Mobile Agents
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 ...
Dan Wang, Ge Yu, Mingsong Lv, Baoyan Song, Derong ...
« Prev « First page 1651 / 1969 Last » Next »