Sciweavers

1888 search results - page 264 / 378
» Proof theory and computational analysis
Sort
View
MOBIHOC
2008
ACM
16 years 1 months ago
Finding popular categories for RFID tags
As RFID tags are increasingly attached to everyday items, it quickly becomes impractical to collect data from every tag in order to extract useful information. In this paper, we c...
Bo Sheng, Chiu Chiang Tan, Qun Li, Weizhen Mao
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
15 years 11 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor
MSR
2006
ACM
15 years 7 months ago
Mining eclipse for cross-cutting concerns
Software may contain functionality that does not align with its architecture. Such cross-cutting concerns do not exist from the beginning but emerge over time. By analysing where ...
Silvia Breu, Thomas Zimmermann, Christian Lindig
GECCO
2005
Springer
137views Optimization» more  GECCO 2005»
15 years 7 months ago
Constant generation for the financial domain using grammatical evolution
This study reports the work to date on the analysis of different methodologies for constant creation with the aim of applying the most advantageous method to the dynamic real wor...
Ian Dempsey
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
15 years 6 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan