Sciweavers

507 search results - page 32 / 102
» Efficient Approximate Wordlength Optimization
Sort
View
IPPS
2002
IEEE
15 years 8 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
144
Voted
AIPS
2009
15 years 4 months ago
Information-Theoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Environmental Sensing
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
120
Voted
AAAI
2008
15 years 6 months ago
Adaptive Importance Sampling with Automatic Model Selection in Value Function Approximation
Off-policy reinforcement learning is aimed at efficiently reusing data samples gathered in the past, which is an essential problem for physically grounded AI as experiments are us...
Hirotaka Hachiya, Takayuki Akiyama, Masashi Sugiya...
159
Voted
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 3 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
123
Voted
CIA
2006
Springer
15 years 7 months ago
Iterative Query-Based Approach to Efficient Task Decomposition and Resource Allocation
Intelligent coordination in complex multi-agent environments requires sophisticated mechanisms for suboptimal task decomposition and efficient resource allocation provided by the t...
Michal Pechoucek, Ondrej Lerch, Jirí B&iacu...