Sciweavers

1456 search results - page 215 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
NLE
2007
148views more  NLE 2007»
14 years 9 months ago
Abbreviated text input using language modeling
We address the problem of improving the efficiency of natural language text input under degraded conditions (for instance, on mobile computing devices or by disabled users), by ta...
Stuart M. Shieber, Rani Nelken
COMPSAC
2000
IEEE
15 years 2 months ago
GAPS: A Genetic Programming System
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...
Michael D. Kramer, Du Zhang
ASAP
2007
IEEE
136views Hardware» more  ASAP 2007»
15 years 4 months ago
0/1 Knapsack on Hardware: A Complete Solution
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
K. Nibbelink, S. Rajopadhye, R. McConnell
INFOCOM
2010
IEEE
14 years 8 months ago
Compressive Sensing Based Positioning Using RSS of WLAN Access Points
Abstract— The sparse nature of location finding problem makes the theory of compressive sensing desirable for indoor positioning in Wireless Local Area Networks (WLANs). In this...
Chen Feng, Wain Sy Anthea Au, Shahrokh Valaee, Zhe...
79
Voted
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
14 years 11 months ago
Search space reduction technique for constrained optimization with tiny feasible space
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
Abu S. S. M. Barkat Ullah, Ruhul A. Sarker, David ...