Sciweavers

475 search results - page 61 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
ECSQARU
2005
Springer
14 years 1 months ago
Type Uncertainty in Ontologically-Grounded Qualitative Probabilistic Matching
This paper is part of a project to match real-world descriptions of instances of objects to models of objects. We use a rich ontology to describe s and models at multiple levels of...
David Poole, Clinton Smyth
MP
2007
145views more  MP 2007»
13 years 7 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
JSA
2007
191views more  JSA 2007»
13 years 7 months ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....
CDC
2009
IEEE
139views Control Systems» more  CDC 2009»
13 years 5 months ago
Synchronization stability of complex dynamical networks with probabilistic time-varying delays
Abstract-- A kind of complex dynamical networks with timevarying coupling delays is proposed. By some transformation, the synchronization problem of the complex networks is transfe...
Hongjie Li, Dong Yue, Zhou Gu
JSAC
2011
136views more  JSAC 2011»
12 years 10 months ago
Spectrum Trading in Cognitive Radio Networks: A Contract-Theoretic Modeling Approach
—Cognitive radio is a promising paradigm to achieve efficient utilization of spectrum resource by allowing the unlicensed users (i.e., secondary users, SUs) to access the licens...
Lin Gao, Xinbing Wang, Youyun Xu, Qian Zhang