Sciweavers

2376 search results - page 439 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
NAA
2000
Springer
97views Mathematics» more  NAA 2000»
14 years 11 days ago
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
Igor Brainman, Sivan Toledo
ATAL
2008
Springer
13 years 10 months ago
Trajectories of goods in distributed allocation
Distributed allocation mechanisms rely on the agents' autonomous (and supposedly rational) behaviour: states evolve as a result of agents contracting deals and exchanging res...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
CCS
2008
ACM
13 years 10 months ago
Revocation games in ephemeral networks
A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact...
Maxim Raya, Mohammad Hossein Manshaei, Márk...
CP
2008
Springer
13 years 10 months ago
Exploiting Common Subexpressions in Numerical CSPs
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
Ignacio Araya, Bertrand Neveu, Gilles Trombettoni
EWCBR
2008
Springer
13 years 10 months ago
Competence-Preserving Case-Deletion Strategy for Case Base Maintenance
The main goal of a Case-Based Reasoning (CBR) system is to provide criteria for evaluating the internal behavior and task efficiency of a particular system for a given initial case...
Mohamed Karim Haouchine, Brigitte Chebel-Morello, ...