Sciweavers

1347 search results - page 167 / 270
» On the Structure of the Minimum Time Function
Sort
View
PERCOM
2007
ACM
16 years 4 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian
WACV
2008
IEEE
15 years 10 months ago
Distributed Visual Processing for a Home Visual Sensor Network
deliver objects, handle emergency, wherever he/she is inside the home. In addition, the burden of processing We address issues dealing with distributed visual power can be distribu...
Kwangsu Kim, Gérard G. Medioni
RSP
2005
IEEE
164views Control Systems» more  RSP 2005»
15 years 10 months ago
High Level Synthesis for Data-Driven Applications
Abstract— John von Neumann proposed his famous architecture in a context where hardware was very expensive and bulky. His goal was to maximize functionality with minimal hardware...
Etienne Bergeron, Xavier Saint-Mleux, Marc Feeley,...
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
15 years 8 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
EVOW
1994
Springer
15 years 8 months ago
Competitive Evolution: A Natural Approach to Operator Selection
One of the main problems in applying evolutionary optimisation methods is the choice of operators and parameter values. This paper propose a competitive evolution method, in which ...
Q. Tuan Pham