Sciweavers

6274 search results - page 295 / 1255
» From query complexity to computational complexity
Sort
View
170
Voted
COMMA
2006
15 years 7 months ago
Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments...
Søren Holbech Nielsen, Simon Parsons
SIROCCO
2003
15 years 7 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
ISEM
2006
91views more  ISEM 2006»
15 years 6 months ago
Computational experimentations in market and supply-chain co-design: a mixed agent approach
The synthetic environment for analysis and simulations (SEAS) is a computational experimentation environment that mimics real life economies, with multiple interlinked markets, mul...
Alok R. Chaturvedi, Shailendra Raj Mehta, Daniel R...
JAR
2006
106views more  JAR 2006»
15 years 6 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
TOG
2010
129views more  TOG 2010»
15 years 25 days ago
Optical computing for fast light transport analysis
We present a general framework for analyzing the transport matrix of a real-world scene at full resolution, without capturing many photos. The key idea is to use projectors and ca...
Matthew O'Toole, Kiriakos N. Kutulakos