Sciweavers

4103 search results - page 166 / 821
» Some results on the Collatz problem
Sort
View
LOPSTR
2004
Springer
16 years 2 hour ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
FPL
2003
Springer
128views Hardware» more  FPL 2003»
15 years 12 months ago
Case Study of a Functional Genomics Application
Although microarrays are already having a tremendous impact on biomedical science, they still present great computational challenges. We examine a particular problem involving the...
Tom Van Court, Martin C. Herbordt, Richard J. Bart...
SAGA
2001
Springer
15 years 11 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
ICRA
1993
IEEE
142views Robotics» more  ICRA 1993»
15 years 10 months ago
Avoiding the Past: A Simple but Effective Strategy for Reactive Navigation
An issue central to the navigation problem is memory. Traditional systems build symbolic maps of the world for navigational reference. Reactive methods, in contrast, eliminate or m...
Tucker R. Balch, Ronald C. Arkin
COLT
2006
Springer
15 years 10 months ago
Online Learning with Constraints
In this paper, we study a sequential decision making problem. The objective is to maximize the total reward while satisfying constraints, which are defined at every time step. The...
Shie Mannor, John N. Tsitsiklis