Sciweavers

8413 search results - page 393 / 1683
» Ordering Problem Subgoals
Sort
View
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
16 years 1 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
AIHC
2007
Springer
16 years 26 days ago
Trajectory-Based Representation of Human Actions
This work addresses the problem of human action recognition by introducing a representation of a human action as a collection of short trajectories that are extracted in areas of ...
Antonios Oikonomopoulos, Ioannis Patras, Maja Pant...
ISSTA
2006
ACM
16 years 19 days ago
Architecture-driven platform independent deterministic replay for distributed hard real-time systems
Distributed hard real-time systems have become a major component of many advanced technical products. Means to ensure their proper quality are thus of paramount importance. To ens...
Holger Giese, Stefan Henkler
LPAR
2005
Springer
16 years 5 days ago
Another Complete Local Search Method for SAT
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
Haiou Shen, Hantao Zhang
179
Voted
CAV
2010
Springer
190views Hardware» more  CAV 2010»
15 years 10 months ago
Measuring and Synthesizing Systems in Probabilistic Environments
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...