Sciweavers

4797 search results - page 3 / 960
» The complexity of partition tasks
Sort
View
DATE
2009
IEEE
138views Hardware» more  DATE 2009»
13 years 9 months ago
An approximation scheme for energy-efficient scheduling of real-time tasks in heterogeneous multiprocessor systems
As application complexity increases, modern embedded systems have adopted heterogeneous processing elements to enhance the computing capability or to reduce the power consumption. ...
Chuan-Yue Yang, Jian-Jia Chen, Tei-Wei Kuo, Lothar...
EGC
2009
Springer
13 years 3 months ago
Alignment-Based Partitioning of Large-Scale Ontologies
Abstract Ontology alignment is an important task for information integration systems that can make different resources, described by various and heterogeneous ontologies, interoper...
Fayçal Hamdi, Brigitte Safar, Chantal Reyna...
IAT
2007
IEEE
13 years 12 months ago
An Application of Automated Negotiation to Distributed Task Allocation
Through automated negotiation we aim to improve task allocation in a distributed sensor network. In particular, we look at a type of adaptive weather-sensing radar that permits th...
Michael Krainin, Bo An, Victor R. Lesser
ATAL
2000
Springer
13 years 10 months ago
Task Coordination Paradigms for Information Agents
In agent systems, different (autonomous) agents collaborate to execute complex tasks. Each agent provides a set of useful capabilities, and the agent system combines these capabili...
Marian H. Nodine, Damith Chandrasekara, Amy Unruh
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
13 years 11 months ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche