16091 search results - page 112 / 3219 » Solving |
ITS
2000
Springer
14 years 19 days ago
2000
Springer
This paper presents an approach to the design of a learning environment in a mathematical domain (elementary combinatorics) where problem solving is based more on modelling than o...
AAAI
2007
13 years 11 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
PKC
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
ACL
2008
13 years 10 months ago
2008
We present a simple linguistically-motivated method for characterizing the semantic relations that hold between two nouns. The approach leverages the vast size of the Web in order...