Sciweavers

667 search results - page 4 / 134
» Computably Based Locally Compact Spaces
Sort
View
FCT
2005
Springer
14 years 1 months ago
Completeness and Compactness of Quantitative Domains
In this paper we study the interplay between metric and order completeness of semantic domains equipped with generalised distances. We prove that for bounded complete posets direct...
Pawel Waszkiewicz
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
13 years 12 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
PAMI
1998
116views more  PAMI 1998»
13 years 7 months ago
Scale-Space Derived From B-Splines
—It is well-known that the linear scale-space theory in computer vision is mainly based on the Gaussian kernel. The purpose of the paper is to propose a scale-space theory based ...
Yu-Ping Wang, Seng Luan Lee
ATAL
2004
Springer
14 years 1 months ago
Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes
In multi-agent MDPs, it is generally necessary to consider the joint state space of all agents, making the size of the problem and the solution exponential in the number of agents...
Dmitri A. Dolgov, Edmund H. Durfee
AFPAC
2000
Springer
341views Mathematics» more  AFPAC 2000»
14 years 5 days ago
An Associative Perception-Action Structure Using a Localized Space Variant Information Representation
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...
Gösta H. Granlund