Sciweavers

204 search results - page 19 / 41
» A Simple and Effective Measure for Complex Low-Level Depende...
Sort
View
CVPR
2006
IEEE
15 years 11 months ago
Dynamics Based Robust Motion Segmentation
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
Roberto Lublinerman, Mario Sznaier, Octavia I. Cam...
HEURISTICS
2010
14 years 7 months ago
A metaheuristic approach to the urban transit routing problem
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
Lang Fan, Christine L. Mumford
77
Voted
SC
2004
ACM
15 years 3 months ago
The Potential of Computation Regrouping for Improving Locality
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
Chen Ding, Maksim Orlovich
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
14 years 11 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
IJCAI
1989
14 years 10 months ago
An Adaptive Model of Decision-Making in Planning
Learning how to make decisions in a domain is a critical aspect of intelligent planning behavior. The ability of a planner to adapt its decision-making to a domain depends in part...
Gregg Collins, Lawrence Birnbaum, Bruce Krulwich