Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: United States
Found
17049 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Exact and approximation algorithms for clustering
2002,
Agarwal P.K.
In this paper we present an n(O(k1 − 1/d)) -time algorithm for solving the k...
Experimental analysis of heuristic algorithms for the dominating set problem
2002,
Sanchis L.A.
We say a vertex upsilon in a graph G covers a vertex omega if upsilon = omega or if...
Approximations for a bottleneck Steiner tree problem
2002,
Wang L.
In the design of wireless communication networks, due to a budget limit, suppose we...
An online algorithm for the dynamic maximal dense tree problem
2002,
Singh T.
The Online Maximal Dense Tree problem is as follows: given a weighted directed graph...
Solvability of 2-player game forms with infinite sets of strategies
1995,
Abdou J.
A game form is N-solvable for a class of payoff functions, if for every pair of payoff...
Canonical representation of set-functions
1995,
Gilboa I.
The representation of a cooperative transferable utility game as a linear combination...
Axiomatization of the nucleolus
1995,
Snijders C.
An axiomatization of the nucleolus on the set of all cooperative games with finite...
Parallel randomized Best-First Minimax Search
2002,
Shoham Y.
We describe a novel parallel randomized search algorithm for two-player games. The...
Games solved: Now and in the future
2002,
Herik H.J. van den
In this article we present an overview on the state of the art in games solved in the...
World-championship-caliber Scrabble
2002,
Sheppard B.
Computer Scrabble programs have achieved a level of performance that exceeds that of...
The challenge of poker
2002,
Billings D.
Poker is an interesting test-bed for artificial intelligence research. It is a game of...
Programming backgammon using self-teaching neural nets
2002,
Tesauro G.
TD-Gammon is a neural network that is able to teach itself to play backgammon solely...
Computer Go
2002,
Muller M.
Computer Go is one of the biggest challenges faced by game programmers. This survey...
Computer shogi
2002,
Iida Hiroshi
This paper describes the current state of the art in computer shogi. Shogi (Japanese...
A hierarchical approach to computer Hex
2002,
Anshelevich V.V.
Hex is a beautiful game with simple rules and a strategic complexity comparable to...
A probabilistic approach to solving crossword puzzles
2002,
Littman M.L.
We attacked the problem of solving crossword puzzles by computer: given a set of clues...
Disjoint pattern database heuristics
2002,
Korf R.E.
We describe a new technique for designing more accurate admissible heuristic...
Generalizations of the concept of core of simple games and their characterization in terms of permission of voters
2002,
Inohara T.
In this paper, we generalize the concept of core of simple games in two ways, and...
The continuous prisoner's dilemma and the evolution of cooperation through reciprocal altruism with variable investment
2002,
Killingback T.
Understanding the evolutionary origin and persistence of cooperative behavior is a...
Using expert opinions in Bayesian prediction of component lifetimes in a shock model
1995,
Natvig B.
This paper is concerned with the combination of k expert opinions about the lifetimes...
Clusterability of groups and information exchange in group decision making with approval voting system
2003,
Inohara T.
In this paper, we discuss the relations between clusterability of a group and...
Linear programming approach to constrained feedback control
2002,
Benvenuti L.
This paper deals with the problem of stabilizing linear discrete-time systems under...
A tutorial for designing flexible geometric algorithms
2002,
Kapoor V.
The implementation of an algorithm is faced with the issues of efficiency,...
Minimizing the average query complexity of learning monotone Boolean functions
2002,
Triantaphyllou Evangelos
This paper addresses the problem of completely reconstructing deterministic monotone...
First Page
236
237
238
239
240
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers