526 search results - page 22 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
107
click to vote
SIAMJO
2002
14 years 9 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
HT
2009
ACM
15 years 27 days ago
2009
ACM
Adaptive hypermedia systems traditionally focus on providing personalised learning services for formal or informal learners. The learning material is typically sourced from a prop...
102
click to vote
CONSTRAINTS
2010
14 years 9 months ago
2010
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
77
Voted
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
d Abstract) Thibault Kruse, Alexandra Kirsch, E. Akin Sisbot, Rachid Alami A robot moving in the presence of humans is highly constrained by the dynamic environment and the need t...
116
click to vote
PE
2000
Springer
14 years 9 months ago
2000
Springer
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...