3875 search results - page 660 / 775 » Approximation algorithms for the 0-extension problem |
130
click to vote
CAV
2001
Springer
15 years 9 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
133
click to vote
SIGMOD
1998
ACM
15 years 8 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
142
click to vote
EMMCVPR
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
130
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...
172
click to vote
COCOA
2009
Springer
15 years 8 months ago
2009
Springer
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...