Sciweavers

1101 search results - page 26 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
ICPR
2002
IEEE
15 years 2 months ago
A Robust Algorithm for Probabilistic Human Recognition From
Human recognition from video requires solving the two tasks, recognition and tracking, simultaneously. This leads to a parameterized time series state space model, representing bo...
Shaohua Kevin Zhou, Rama Chellappa
INFOCOM
2009
IEEE
15 years 4 months ago
Using Failure Models for Controlling Data Availability in Wireless Sensor Networks
— This paper presents Pirrus, a replica management system that addresses the problem of providing data availability on a wireless sensor network. Pirrus uses probabilistic failur...
Riccardo Crepaldi, Mirko Montanari, Indranil Gupta...
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 1 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
INFORMATICALT
2010
101views more  INFORMATICALT 2010»
14 years 8 months ago
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
Chen-Sung Chang
SAC
2010
ACM
15 years 4 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...