1816 search results - page 163 / 364 » A New Approach for Solving the Maximum Clique Problem |
166
click to vote
TSMC
1998
15 years 6 months ago
1998
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
175
click to vote
AIMSA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
247
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Mashup is a new application development approach that allows users to aggregate multiple services to create a service for a new purpose. Even if the Mashup approach opens new and ...
176
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
157
click to vote
ICCV
2005
IEEE
16 years 3 days ago
2005
IEEE
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...