14518 search results - page 59 / 2904 » Two Problems for Sophistication |
STOC
2007
ACM
14 years 9 months ago
2007
ACM
In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...
CAISE
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Addressed in this paper is the problem of conceptual heterogeneity within the field of information systems. Two frameworks, Frisco and S¨oderstr¨om, each reflecting t...
CP
2003
Springer
14 years 2 months ago
2003
Springer
We propose a two-level search strategy to solve a two dimensional circle packing problem. At the first level, a good enough packing algorithm called
JCDCG
2000
Springer
14 years 17 days ago
2000
Springer
We consider the following problem. Let n 2, b 1 and q 2 be integers. Let R and B be two disjoint sets of n red points and bn blue points in the plane, respectively, such that no...
DISOPT
2008
13 years 9 months ago
2008
We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, whe...