Sciweavers

14379 search results - page 2542 / 2876
» is 2000
Sort
View
AIL
2000
78views more  AIL 2000»
15 years 6 months ago
Representation of formal dispute with a standing order
Computational dialectics is a relatively new field. It is, among others, concerned with the formal representation of argument and dispute. The goal is to suggest algorithms, proce...
Gerard Vreeswijk
156
Voted
AIM
2000
15 years 6 months ago
Probabilistic Algorithms in Robotics
This article describes a methodology for programming robots known as probabilistic robotics. The probabilistic paradigm pays tribute to the inherent uncertainty in robot perceptio...
Sebastian Thrun
AIS
2000
Springer
15 years 6 months ago
Early-connectionism machines
: In this paper I put forward a reconstruction of the evolution of certain explanatory hypotheses on the neural basis of association and learning that are the premises of connectio...
Roberto Cordeschi
ALGORITHMICA
2000
87views more  ALGORITHMICA 2000»
15 years 6 months ago
Linear Size Binary Space Partitions for Uncluttered Scenes
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
Mark de Berg
ALGORITHMICA
2000
72views more  ALGORITHMICA 2000»
15 years 6 months ago
Sorting-Based Selection Algorithms for Hypercubic Networks
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
Pascal Berthomé, Afonso Ferreira, Bruce M. ...
« Prev « First page 2542 / 2876 Last » Next »