9405 search results - page 313 / 1881 » Computing a Model of Set Theory |
142
click to vote
LICS
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
147
Voted
ISPDC
2005
IEEE
15 years 10 months ago
2005
IEEE
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...
128
click to vote
AMAI
2002
Springer
15 years 4 months ago
2002
Springer
Probabilistic argumentation systems are based on assumption-based reasoning for obtaining arguments supporting hypotheses and on probability theory to compute probabilities of sup...
152
Voted
CANDC
2005
ACM
15 years 6 months ago
2005
ACM
A prototype system for the automatic evolution of biomimetic structures using structural automata is described and its utility for generating digital sculpture is demonstrated. Sc...
124
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...