672 search results - page 104 / 135 » A General Solution to the Graph History Interaction Problem |
CONSTRAINTS
1998
13 years 8 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
IPSN
2011
Springer
13 years 2 days ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
ECCV
2006
Springer
14 years 10 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
ICRA
2003
IEEE
14 years 1 months ago
2003
IEEE
Existing task allocation algorithms generally do not consider the effects of task interaction, such as interference, but instead assume that tasks are independent. That assumptio...