1719 search results - page 120 / 344 » Scheduling with soft constraints |
CONSTRAINTS
2010
13 years 10 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
INFOCOM
2008
IEEE
14 years 5 months ago
2008
IEEE
—Providing anonymity to routes in a wireless ad hoc network from passive eavesdroppers is considered. Using Shannon’s equivocation as an information theoretic measure of anonym...
CSCLP
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
ICASSP
2009
IEEE
14 years 5 months ago
2009
IEEE
In this paper, we propose two approaches for combining geometric information with ICA algorithm to solve permutation problem under the scenario where a rough information about the...
EUROPAR
2004
Springer
14 years 4 months ago
2004
Springer
Since embedded systems require ever more compute power, SMT processors are viable candidates for future high performance embedded processors. However, SMTs exhibit unpredictable pe...