Sciweavers

2657 search results - page 402 / 532
» On the complexity of hierarchical problem solving
Sort
View
IAT
2003
IEEE
15 years 3 months ago
Agent-based decision support for actual-world procurement scenarios
Multi-item, multi-unit negotiations in industrial procurement pose serious challenges to buying agents when trying to determine the best set of providering agents’ offers. Typic...
Juan A. Rodríguez-Aguilar, Andrea Giovannuc...
INFOCOM
2003
IEEE
15 years 3 months ago
Time-Optimal Network Queue Control: The Case of a Single Congested Node
-We solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time aft...
Mahadevan Iyer, Wei Kang Tsai
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
15 years 3 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
CASES
2003
ACM
15 years 3 months ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara
APWEB
2003
Springer
15 years 3 months ago
An Ant Algorithm Based Dynamic Routing Strategy for Mobile Agents
Routing strategy is one of the most important aspects in a mobile agent system, which is a complex combinatorial problem. Most of current mobile agent systems adopt static routing ...
Dan Wang, Ge Yu, Mingsong Lv, Baoyan Song, Derong ...