Sciweavers

757 search results - page 87 / 152
» How to decide
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
To Cache or Not To Cache?
—We address cooperative caching in mobile ad hoc networks where information is exchanged in a peer-to-peer fashion among the network nodes. Our objective is to devise a fully-dis...
Marco Fiore, Francesco Mininni, Claudio Casetti, C...
AAAI
2000
13 years 10 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
CEC
2005
IEEE
14 years 2 months ago
Adaptive local search parameters for real-coded memetic algorithms
AbstractThis paper presents a real-coded memetic algorithm that combines a high diversity global exploration with an adaptive local search method to the most promising individuals ...
Daniel Molina, Francisco Herrera, Manuel Lozano
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Average Case Analysis for Tree Labelling Schemes
We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] prove...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
CIB
2005
125views more  CIB 2005»
13 years 9 months ago
An On-Line Web Visualization System with Filtering and Clustering Graph
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...
Wei Lai, Xiaodi Huang, Ronald Wibowo, Jiro Tanaka