Sciweavers

351 search results - page 47 / 71
» Classical proof forestry
Sort
View
JSW
2008
105views more  JSW 2008»
13 years 7 months ago
Reasoning Principles for Negotiating Agent
Automated negotiation is an important applying field of agent theory and technology. For the current agent theoretical models have some troubles in explaining the agent's nego...
Mukun Cao, Yuqiang Feng
MST
2008
150views more  MST 2008»
13 years 7 months ago
Coinduction for Exact Real Number Computation
This paper studies coinductive representations of real numbers by signed digit streams and fast Cauchy sequences. It is shown how the associated coinductive principle can be used ...
Ulrich Berger, Tie Hou
JOC
2007
169views more  JOC 2007»
13 years 7 months ago
Another Look at "Provable Security"
We give an informal analysis and critique of several typical “provable security” results. In some cases there are intuitive but convincing arguments for rejecting the conclusi...
Neal Koblitz, Alfred Menezes
JALC
2002
97views more  JALC 2002»
13 years 7 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
COMBINATORICS
1999
139views more  COMBINATORICS 1999»
13 years 7 months ago
A Closer Look at Lattice Points in Rational Simplices
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
Matthias Beck