Sciweavers

3708 search results - page 624 / 742
» Approximating Betweenness Centrality
Sort
View
86
Voted
IJCAI
1989
15 years 1 months ago
A Model for Projection and Action
In designing autonomous agents that deal competently with issues involving time and space, there is a tradeoff to be made between guaranteed response-time reactions on the one han...
Keiji Kanazawa, Thomas Dean
115
Voted
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 1 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
106
Voted
CEC
2010
IEEE
15 years 1 months ago
Local Optima Networks of the Quadratic Assignment Problem
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...
Fabio Daolio, Sébastien Vérel, Gabri...
CIMAGING
2009
184views Hardware» more  CIMAGING 2009»
15 years 1 months ago
Fast space-varying convolution and its application in stray light reduction
Space-varying convolution often arises in the modeling or restoration of images captured by optical imaging systems. For example, in applications such as microscopy or photography...
Jianing Wei, Guangzhi Cao, Charles A. Bouman, Jan ...
99
Voted
ECAI
2010
Springer
15 years 1 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert