56 search results - page 7 / 12 » Dynamically Partitioning for Solving QBF |
ICPADS
2006
IEEE
15 years 3 months ago
2006
IEEE
We developed Hi-sap, a web server system that ensures the security in a server and has high performance when processing dynamic content. In existing servers, server embedded progr...
ICTAI
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
EUROSYS
2006
ACM
15 years 6 months ago
2006
ACM
The database tier of dynamic content servers at large Internet sites is typically hosted on centralized and expensive hardware. Recently, research prototypes have proposed using d...
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
Many clustering algorithms have been proposed to partition a set of static data points into groups. In this paper, we consider an evolutionary clustering problem where the input d...