Sciweavers

3020 search results - page 520 / 604
» Optimal partition trees
Sort
View
CASES
2003
ACM
15 years 9 months ago
Compiler-decided dynamic memory allocation for scratch-pad based embedded systems
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...
Sumesh Udayakumaran, Rajeev Barua
INFOCOM
2000
IEEE
15 years 8 months ago
QoS Routing with Performance-Dependent Costs
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
Funda Ergün, Rakesh K. Sinha, Lisa Zhang
FM
2008
Springer
152views Formal Methods» more  FM 2008»
15 years 6 months ago
Constraint Prioritization for Efficient Analysis of Declarative Models
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
Engin Uzuncaova, Sarfraz Khurshid
CASCON
2007
138views Education» more  CASCON 2007»
15 years 5 months ago
SLA-driven business process management in SOA
The management of non-functional goals, or Service Level Agreements (SLA), in the development of business processes in a Service Oriented Architecture often requires much manual a...
Vinod Muthusamy, Hans-Arno Jacobsen, Phil Coulthar...
SIGECOM
2008
ACM
220views ECommerce» more  SIGECOM 2008»
15 years 4 months ago
Better redistribution with inefficient allocation in multi-unit auctions with unit demand
For the problem of allocating one or more items among a group of competing agents, the Vickrey-Clarke-Groves (VCG) mechanism is strategy-proof and efficient. However, the VCG mech...
Mingyu Guo, Vincent Conitzer