4037 search results - page 582 / 808 » Routing without ordering |
146
click to vote
AAAI
2007
15 years 7 months ago
2007
Assessing recovery from stroke has been so far a time consuming procedure in which highly trained clinicians are required. This paper proposes a mechatronic platform which measure...
158
click to vote
AIPS
2007
15 years 7 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
123
click to vote
DLOG
2007
15 years 7 months ago
2007
In this paper we deal with the problem of providing natural language front-ends to databases upon which an ontology layer has been added. Specifically, we are interested in expres...
155
click to vote
FLAIRS
2008
15 years 7 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
160
click to vote
EDBT
2010
ACM
15 years 6 months ago
2010
ACM
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches...