16091 search results - page 112 / 3219 » Solving |
119
Voted
ITS
2000
Springer
15 years 6 months 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...
106
click to vote
AAAI
2007
15 years 4 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...
152
click to vote
PKC
2010
Springer
15 years 4 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...
105
Voted
ECAI
2008
Springer
15 years 4 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...
106
Voted
ACL
2008
15 years 3 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...