6365 search results - page 1036 / 1273 » Fast Local Computation Algorithms |
139
click to vote
COCO
2004
Springer
16 years 1 days ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
184
click to vote
EVOW
2004
Springer
16 years 1 days ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
187
click to vote
APCSAC
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIU...
198
click to vote
ICNP
2003
IEEE
15 years 12 months ago
2003
IEEE
In some harsh environments, manually deploying sensors is impossible. Alternative methods may lead to imprecise placement resulting in coverage holes. To provide the required high...
175
click to vote
GLOBE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We show how to specify and use the metadata for a virtual and relational data integration system under the local-as-view (LAV) approach. We use XML and RuleML for represe...