752 search results - page 101 / 151 » The standard parts problem and the complexity of control com... |
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
IWVF
2001
Springer
14 years 9 days ago
2001
Springer
We consider the problem of recognizing an object from its silhouette. We focus on the case in which the camera translates, and rotates about a known axis parallel to the image, suc...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Recent technology trends in the Web Services (WS) domain indicate that a solution eliminating the presumed complexity of the WS-* standards may be in sight: advocates of REpresent...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...