Sciweavers

199 search results - page 17 / 40
» Complexity of two dual criteria scheduling problems
Sort
View
BROADNETS
2006
IEEE
14 years 1 months ago
Distributed Job Scheduling based on Multiple Constraints Anycast Routing
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...
AAAI
2012
11 years 10 months ago
Threats and Trade-Offs in Resource Critical Crowdsourcing Tasks Over Networks
In recent times, crowdsourcing over social networks has emerged as an active tool for complex task execution. In this paper, we address the problem faced by a planner to incentivi...
Swaprava Nath, Pankaj Dayama, Dinesh Garg, Y. Nara...
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
14 years 3 days ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
ICC
2007
IEEE
126views Communications» more  ICC 2007»
14 years 2 months ago
Evaluation of Grouping Strategies for an Hierarchical SDMA/TDMA Scheduling Process
Abstract— Adding SDMA capabilities to modern wireless communication systems like IEEE 802.16 WiMAX promises high system capacity gains but raises the problem of combining orthogo...
Christian Hoymann, Jan Ellenbeck, Ralf Pabst, Marc...