Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleSeptember 1999
-
- articleApril 1996
Monitoring anytime algorithms
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. To exploit this tradeoff, a system must be able to determine the best time ...
- articleJanuary 1996
ABA: an assignment based algorithm for resource allocation
In this paper we describe an approach to allocating a set of tasks to a set of resources or processors. The novelty of the approach has to do with the way decisions are performed. Rather than making one decision about one resource (or one task) at a ...
- articleOctober 1992
General natural language for operating systems
This paper proposes a general natural language interface for operating systems. It adopts an Application-Independent Hierarchic approach (AIH) to developing general natural language interfaces. AIH separates the application-specific part of natural ...
- articleFebruary 1991
Checkers program to challenge for world championship
The checkers program Chinook has won the right to play a 40-game match for the World Checkers Championship against Dr. Marion Tinsley. This was earned by placing second, after Dr. Tinsley, at the U.S. National Open, the biennial event used to determine ...
- articleJune 1990
Generalization of the language version determination problem
In this paper, we generalize the language version determination problem by relaxing the assumption of version subset relationship. The search algorithms proposed for the generalized problem involve constant search time using a hash table to implement ...
- articleJanuary 1987
Finding heuristics for flowshop scheduling
Different flow shops are characterized by different-often wildly different--preferences and constraints. While simple heuristics often permit efficient construction of excellent schedules, the discovery of such heuristics generally depends on deep ...
- articleOctober 1986
Interactive problem solving
An interactive generation of a solution to a 3 × 3 × 2 cube-like problem is presented.
- articleOctober 1986
Some heuristics for playing Mastermind
Several articles have appeared in SIGART Newsletter on the game of Mastermind during the recent three to four years (1 - 8). In particular, P. Norvig described a heuristic for obtaining an approximation to the optimal solution(1). In this article, ...
- articleJuly 1986
The RM-CELL: A set of old ideas that produce new results
This paper reports a system with unexpected features. Starting from scratch, it learns to synthesize the function between the input and the output of a black box, which receives N bits and produces one. After being trained with one pass of a random ...
- articleJuly 1986
RiTSE: The reactor trip simulation environment
Management Analysis Company, located in San Diego, is a general consulting corporation dealing almost exclusively with nuclear power generation.
- articleApril 1986
The 1985 Fredkin competition
We have now been running Fredkin competitions designed to find out how good the best computer chess entities really are, since 1980. These have always taken the form of computer-human competition, as this seems to be the way to bring reality to the ...