Sciweavers

1651 search results - page 288 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ATVA
2006
Springer
112views Hardware» more  ATVA 2006»
13 years 11 months ago
Synthesis for Probabilistic Environments
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
Sven Schewe
CP
2006
Springer
13 years 11 months ago
Failure Analysis in Backtrack Search for Constraint Satisfaction
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Tudor Hulubei, Barry O'Sullivan
E2EMON
2006
IEEE
13 years 11 months ago
Object-Relational DBMS for Packet-Level Traffic Analysis: Case Study on Performance Optimization
Analyzing Internet traffic at packet level involves generally large amounts of raw data, derived data, and results from various analysis tasks. In addition, the analysis often proc...
Matti Siekkinen, Ernst W. Biersack, Vera Goebel
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
13 years 11 months ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis
ECCV
2010
Springer
13 years 11 months ago
Exploring Ambiguities for Monocular Non-Rigid Shape Estimation
Recovering the 3D shape of deformable surfaces from single images is difficult because many different shapes have very similar projections. This is commonly addressed by restricti...