Sciweavers

1237 search results - page 70 / 248
» Strictness and Totality Analysis
Sort
View
ATAL
2005
Springer
15 years 12 months ago
Efficient information retrieval using mobile agents
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
Irene Sygkouna, Miltiades E. Anagnostou
GD
2009
Springer
15 years 11 months ago
Semi-bipartite Graph Visualization for Gene Ontology Networks
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
Kai Xu 0003, Rohan Williams, Seok-Hee Hong, Qing L...
CSE
2009
IEEE
15 years 10 months ago
Efficient Broadcast on Area of Interest in Voronoi Overlays
This paper presents an algorithm to perform the broadcasting of a packet to all the peers that are located into a convex region (Area of Interest) in a Voronoi based peer-topeer ne...
Michele Albano, Ranieri Baraglia, Matteo Mordacchi...
WSC
1997
15 years 7 months ago
New Development of Optimal Computing Budget Allocation for Discrete Event Simulation
This paper deals with ranking and selection problem via simulation. We present an optimal computing budget allocation technique which can select the best of k simulated designs. T...
Hsiao-Chang Chen, Chun-Hung Chen, Liyi Dai, Enver ...
JAL
2006
89views more  JAL 2006»
15 years 6 months ago
Improved bounds for the unsplittable flow problem
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
Petr Kolman, Christian Scheideler