Sciweavers

1139 search results - page 215 / 228
» Bounded Ideation Theory
Sort
View
KR
2004
Springer
14 years 1 months ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade
MOBICOM
2003
ACM
14 years 27 days ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
14 years 27 days ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri
SMA
2003
ACM
123views Solid Modeling» more  SMA 2003»
14 years 27 days ago
Collision prediction for polyhedra under screw motions
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
ByungMoon Kim, Jarek Rossignac
ASIACRYPT
2003
Springer
14 years 27 days ago
Almost Uniform Density of Power Residues and the Provable Security of ESIGN
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
Tatsuaki Okamoto, Jacques Stern