1389 search results - page 146 / 278 » Improved Approximation Algorithms for Label Cover Problems |
126
click to vote
ICCAD
1993
IEEE
15 years 7 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
113
click to vote
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— Satellite operators have recently begun offering Internet access over their networks. Typically, users connect to the network using a modem for uplink, and a satellite dish for...
173
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
120
click to vote
ESANN
2003
15 years 4 months ago
2003
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
146
click to vote
AIMSA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...