Sciweavers

4342 search results - page 660 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
WONS
2005
IEEE
16 years 3 days ago
Ant Agents for Hybrid Multipath Routing in Mobile Ad Hoc Networks
In this paper we describe AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the Nature-inspired Ant Colony Optimization framework. The algorithm co...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...
173
Voted
ICDCS
2003
IEEE
15 years 12 months ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande
158
Voted
BIRTHDAY
2003
Springer
15 years 11 months ago
Parallel Digital Halftoning by Error-Diffusion
Digital halftoning, or dithering, is the technique commonly used to render a color or grayscale image on a printer, a computer monitor or other bi-level displays. A particular hal...
Panagiotis Takis Metaxas
LICS
1997
IEEE
15 years 10 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
168
Voted
IPPS
1994
IEEE
15 years 10 months ago
Efficient Matrix Chain Ordering in Polylog Time
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
Phillip G. Bradford, Gregory J. E. Rawlins, Gregor...