Sciweavers

2736 search results - page 24 / 548
» Implementable allocation rules
Sort
View
SIGECOM
2008
ACM
220views ECommerce» more  SIGECOM 2008»
13 years 11 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
IWMM
1998
Springer
103views Hardware» more  IWMM 1998»
14 years 3 months ago
The Memory Fragmentation Problem: Solved?
We show that for 8 real and varied C and C++ programs, several conventional dynamic storage allocators provide nearzero fragmentation, once we account for overheads due to impleme...
Mark S. Johnstone, Paul R. Wilson
APSEC
2008
IEEE
14 years 5 months ago
Jackson's JSP-Like Method for State Transition Design
This paper presents an idea to apply Jackson’s JSP method, which is suitable for the transformation problem frame, into the state transition design, presented in the behavior pr...
Osamu Shigo
FLAIRS
2006
14 years 10 days ago
Incremental Propagation of Time Windows on Disjunctive Resources
Constraint-based techniques are frequently used in solving real-life scheduling problems thanks to natural modeling capabilities and strong constraint propagation techniques encod...
Roman Barták
RTAS
2007
IEEE
14 years 5 months ago
Optimizing the FPGA Implementation of HRT Systems
The availability of programmable hardware devices with high density of logic elements and the possibility of implementing CPUs (called softcores) using a fraction of the FPGA area...
Marco Di Natale, Enrico Bini