Sciweavers

4047 search results - page 809 / 810
» The Discrete Basis Problem
Sort
View
ICSE
2012
IEEE-ACM
11 years 8 months ago
WitchDoctor: IDE support for real-time auto-completion of refactorings
—Integrated Development Environments (IDEs) have come to perform a wide variety of tasks on behalf of the programmer, refactoring being a classic example. These operations have u...
Stephen R. Foster, William G. Griswold, Sorin Lern...
ICML
1996
IEEE
14 years 6 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
14 years 5 days ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
FUN
2010
Springer
312views Algorithms» more  FUN 2010»
13 years 10 months ago
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, ...
COMGEO
2011
ACM
13 years 21 days ago
Improved bounds for cops-and-robber pursuit
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
Laurent Alonso, Edward M. Reingold