4114 search results - page 10 / 823 » Efficient Algorithms for the 2-Center Problems |
135
click to vote
AICOM
2004
15 years 3 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
127
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
137
click to vote
ESOP
2009
Springer
15 years 7 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
SODA
2001
ACM
15 years 5 months ago
2001
ACM
