Sciweavers

2714 search results - page 312 / 543
» Model comparison with GenericDiff
Sort
View
ICOIN
2003
Springer
15 years 11 months ago
Information-Theoretic Bounds for Mobile Ad-hoc Networks Routing Protocols
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
Nianjun Zhou, Alhussein A. Abouzeid
CEC
2009
IEEE
15 years 11 months ago
LoCost: A spatial social network algorithm for multi-objective optimisation
—Particle Swarm Optimisation (PSO) is increasingly being applied to optimisation of problems in engineering design and scientific investigation. While readily adapted to singleo...
Andrew Lewis
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
15 years 11 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
CIKM
2001
Springer
15 years 11 months ago
Automatic Query Expansion Based on Divergence
In this paper we are mainly concerned with discussion of a formal model, based on the basic concept of divergence from information theory, for automatic query expansion. The basic...
D. Cai, C. J. van Rijsbergen, Joemon M. Jose
ISMIR
2001
Springer
196views Music» more  ISMIR 2001»
15 years 11 months ago
MUSART: Music Retrieval Via Aural Queries
MUSART is a research project developing and studying new techniques for music information retrieval. The MUSART architecture uses a variety of representations to support multiple ...
William P. Birmingham