Sciweavers

3913 search results - page 457 / 783
» complexity 2006
Sort
View
AIM
2004
15 years 6 months ago
An AI Planning-based Tool for Scheduling Satellite Nominal Operations
Satellite domains are becoming a fashionable area of research within the AI community due to the complexity of the problems that these domains need to solve. With the current US a...
María Dolores Rodríguez-Moreno, Dani...
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
ET
2000
80views more  ET 2000»
15 years 6 months ago
A New Method for Testing Re-Programmable PLAs
: We present a method for obtaining a minimal set of test configurations and their associated set oftest patterns that completely tests re-programmable Programmable Logic Arrays (P...
Charles E. Stroud, James R. Bailey, Johan R. Emmer...
ETT
2000
85views Education» more  ETT 2000»
15 years 6 months ago
Simple On-Line Scheduling Algorithms for All-Optical Broadcast-and-Select Networks
This paper considers all-optical broadcast networks providing a number of slotted WDM channels for packet communications. Each network user is equipped with one tunable transmitter...
Marco Ajmone Marsan, Andrea Bianco, Emilio Leonard...
FUIN
2000
71views more  FUIN 2000»
15 years 6 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri