Sciweavers

4378 search results - page 734 / 876
» On the Complexity of Ordered Colourings
Sort
View
ATAL
2009
Springer
16 years 1 months ago
Evaluating hybrid constraint tightening for scheduling agents
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
James C. Boerkoel Jr., Edmund H. Durfee
ATAL
2009
Springer
16 years 1 months ago
An analysis of feasible solutions for multi-issue negotiation involving nonlinear utility functions
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
16 years 1 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
ASPDAC
2009
ACM
152views Hardware» more  ASPDAC 2009»
16 years 1 months ago
A novel Toffoli network synthesis algorithm for reversible logic
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...
Yexin Zheng, Chao Huang
CF
2009
ACM
16 years 1 months ago
A light-weight fairness mechanism for chip multiprocessor memory systems
Chip Multiprocessor (CMP) memory systems suffer from the effects of destructive thread interference. This interference reduces performance predictability because it depends heavil...
Magnus Jahre, Lasse Natvig