Sciweavers

1814 search results - page 3 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
CASES
2010
ACM
13 years 5 months ago
Improved procedure placement for set associative caches
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
Yun Liang, Tulika Mitra
MLMTA
2003
13 years 9 months ago
Improved Experimental Results Using Fuzzy Lattice Neurocomputing (FLN) Classifiers
— This work shows comparatively the capacity of five Fuzzy Lattice Neurocomputing (FLN) classifiers. The mechanics of the five classifiers are illustrated geometrically on the pl...
Al Cripps, Vassilis G. Kaburlasos, Nghiep Nguyen, ...
COMPGEOM
2009
ACM
14 years 2 months ago
On the set multi-cover problem in geometric settings
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-P...
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
14 years 1 months ago
Artificial immune system for solving generalized geometric problems: a preliminary results
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Jui-Yu Wu, Yun-Kung Chung