• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 25
Next 10 →

Constraint lingo: A program for solving logic puzzles and other tabular constraint problems

by Raphael Finkel, Victor W. Marek, Miros Law Truszczynski - Logics in Artificial Intelligence, volume 2424 of Lecture Notes in Computer Science. Berlin
"... Constraint Lingo is a high-level language for specifying and solving tabular con-straint problems [FMT01]. We show the syntax of this language through ex-amples. Our software translates Constraint Lingo programs into a variety of ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Constraint Lingo is a high-level language for specifying and solving tabular con-straint problems [FMT01]. We show the syntax of this language through ex-amples. Our software translates Constraint Lingo programs into a variety of

CS4098: Minor Software Project- Puzzle Design using Constraint Programming

by Jael Elisabeth Kriener, Supervisor Ian Miguel
"... A method is presented to design instances of the puzzle minesweeper by ltering out those that are unlikely to be solvable without guesswork. To achieve this, the process of solving minesweeper is modeled as a constraint satisfaction problem, encoding inferences typically made by a player as constrai ..."
Abstract - Add to MetaCart
A method is presented to design instances of the puzzle minesweeper by ltering out those that are unlikely to be solvable without guesswork. To achieve this, the process of solving minesweeper is modeled as a constraint satisfaction problem, encoding inferences typically made by a player

Design and Evaluation of Formal Representations: An Incremental Approach using Logic Grid Puzzles

by Koen Hindriks, Joost Vromans
"... It has been suggested to use logic puzzles as a test suite for computational systems that are able to answer questions based on a precise understanding of the natural language input (see [2]). There are several benefits of using logic puzzles for evaluating natural language understanding systems. Mo ..."
Abstract - Add to MetaCart
to reason with natural language input. Finally, logic puzzles define precise and well-structured problems, which set clear evaluation criteria for the performance of the computational system trying to solve such puzzles. There is a variety of logic puzzles that one can use for such evaluation purposes

Difficulty Rating of Sudoku Puzzles by a Computational Model

by Radek Pelánek , 2011
"... We discuss and evaluate metrics for difficulty rating of Sudoku puzzles. The correlation coefficient with human performance for our best metric is 0.95. The data on human performance were obtained from three web portals and they comprise thousands of hours of human solving over 2000 problems. We pro ..."
Abstract - Cited by 5 (4 self) - Add to MetaCart
provide a simple computational model of human solving activity and evaluate it over collected data. Using the model we show that there are two sources of problem difficulty: complexity of individual steps (logic operations) and structure of dependency among steps. Beside providing a very good Sudoku

Modelling and Solving English Peg Solitaire

by Christopher Jefferson, Angela Miguel, Ian Miguel, S. Armagan Tarim , 2003
"... Peg Solitaire is a well known puzzle, which can prove difficult despite its simple rules. Pegs are arranged on a board such that at least one ‘hole’ remains. By making draughts/checkers-like moves, pegs are gradually removed until no further moves are possible or some goal configuration is achieved. ..."
Abstract - Cited by 20 (9 self) - Add to MetaCart
empirically. The sequential nature of the puzzle naturally conforms to a planning problem, hence we also present an experimental comparison with several leading AI planning systems. Other variants of the puzzle, such as ‘Fool’s Solitaire’ and ‘Long-hop’ Solitaire are also considered.

Difficulty Rating of Sudoku Puzzles: An Overview and Evaluation

by Radek Pelánek
"... How can we predict the difficulty of a Sudoku puzzle? We give an overview of difficulty rating metrics and evaluate them on exten-sive dataset on human problem solving (more then 1700 Sudoku puzzles, hundreds of solvers). The best results are obtained using a computational model of human solving act ..."
Abstract - Add to MetaCart
How can we predict the difficulty of a Sudoku puzzle? We give an overview of difficulty rating metrics and evaluate them on exten-sive dataset on human problem solving (more then 1700 Sudoku puzzles, hundreds of solvers). The best results are obtained using a computational model of human solving

Difficulty Rating of Sudoku Puzzles: An Overview and Evaluation

by Radek Pelánek , 2014
"... How can we predict the difficulty of a Sudoku puzzle? We give an overview of difficulty rating metrics and evaluate them on exten-sive dataset on human problem solving (more then 1700 Sudoku puzzles, hundreds of solvers). The best results are obtained using a computa-tional model of human solving a ..."
Abstract - Add to MetaCart
How can we predict the difficulty of a Sudoku puzzle? We give an overview of difficulty rating metrics and evaluate them on exten-sive dataset on human problem solving (more then 1700 Sudoku puzzles, hundreds of solvers). The best results are obtained using a computa-tional model of human solving

Modeling Firm Dynamics to Identify the Cost of Financing Constraints in Ghanaian Manufacturing ∗

by Matthias Schündeln
"... Economic development requires the growth of productive firms. However, financing constraints may limit firms ’ investment abilities. This paper estimates the cost of financing constraints to firms, for example in terms of idle investment opportunities, and their aggregate implications. In the first ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
financing constraints, namely to identify the investment opportunities and the constraints of a firm separately. The model also allows for other potential explanations of the observed phenomenon, in particular adjustment costs and uncertainty. I solve the model using dynamic programming methods and estimate

The Consistent Labeling Problem: Part I

by Robert M. Haralick, Senior Member, Linda, G. Shapiro - IEEE Trans. Pattern Anal. Mach. Intell , 1979
"... Abstract-In this first part of a two-part paper we introduce a general consistent labeling problem based on a unit constraint relation T con-taining N-tuples of units which constrain one another, and a compatibil-ity relation R containing N-tuples of unit-label pairs specifying which N-tuples of uni ..."
Abstract - Cited by 33 (3 self) - Add to MetaCart
-tuples of units are compatible with which N-tuples of labels. We show that Latin square puzzles, finding N-ary relations, graph or auto-mata homomorphisms, graph colorings, as well as determining satisfiabil-ity of propositional logic statements and solving scene and edge labeling problems, are all special cases

The Feldstein-Horioka Puzzle: a Panel Smooth Transition Regression Approach

by ; Tesar , Baxter , ; Crucini , Coakley
"... Abstract This paper proposes an original framework to determine the relative influence of five factors on Feldstein and Horioka outcome of a high saving-investment association among OECD countries. Based on panel threshold regression models, we derive country-specific and time-specific saving reten ..."
Abstract - Add to MetaCart
) as additional explanatory variables, it does not solve the problem: the conditional relationship between investment and saving is assumed to be homogeneous as long as β i is common for all i. Secondly, the equation where q it denotes threshold variables, c a threshold parameter and where the 5 For a
Next 10 →
Results 1 - 10 of 25
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University