13376 search results - page 458 / 2676 » Problem Solving with |
140
Voted
OPODIS
2008
15 years 6 months ago
2008
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...
125
click to vote
ICTAI
2007
IEEE
15 years 11 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
140
click to vote
AIPS
2007
15 years 7 months ago
2007
Decomposition has proved an effective strategy in planning, with one decomposition-based planner, SGPLAN, exhibiting strong performance in the last two IPCs. By decomposing planni...
160
Voted
WWW
2004
ACM
16 years 5 months ago
2004
ACM
To be able to realize the vision of the semantic web an important bottleneck that needs to be solved is an easy and intuitive approach for the annotation of websites with semantic...
124
click to vote
GMP
2006
IEEE
15 years 11 months ago
2006
IEEE
The problem of approximating a given set of data points by splines composed of Pythagorean Hodograph (PH) curves is addressed. In order to solve this highly non-linear problem, we ...