4112 search results - page 6 / 823 » Efficient Algorithms for the Spoonerism Problem |
121
click to vote
ENTCS
2002
14 years 11 months ago
2002
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
92
Voted
AICOM
2004
14 years 11 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...
SIAMCOMP
1998
14 years 11 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
STACS
2010
Springer
15 years 6 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...
SODA
1994
ACM
15 years 29 days ago
1994
ACM
