8540 search results - page 1466 / 1708 » The Dynamic Servers Problem |
193
click to vote
RR
2007
Springer
16 years 18 days ago
2007
Springer
For the foreseeable future, most data will continue to be stored in relational databases. To work with these data in ontology-based applications, tools and techniques that bridge t...
150
click to vote
SARA
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. If a CSP instance has no solution, it contains a smaller unsolvable subproblem that makes unsolvable the whole problem. When solving such instance, instead of just return...
198
click to vote
AINA
2006
IEEE
16 years 17 days ago
2006
IEEE
Efficient service discovery in dynamic, crossorganizational VO is one of the challenge aspects in ChinaGrid. Network overlay and search algorithms are two important considerations...
168
click to vote
AVSS
2006
IEEE
16 years 17 days ago
2006
IEEE
In this paper we address the spatial activity recognition problem with an algorithm based on Smith-Waterman (SW) local alignment. The proposed SW approach utilises dynamic program...
183
click to vote
CGO
2006
IEEE
16 years 17 days ago
2006
IEEE
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...