Sciweavers

4047 search results - page 137 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
AMC
2006
79views more  AMC 2006»
15 years 4 months ago
Church's thesis meets the N-body problem
``Church's thesis'' is at the foundation of computer science. We point out that with any particular set of physical laws, Church's thesis need not merely be po...
Warren D. Smith
LOGCOM
2010
96views more  LOGCOM 2010»
15 years 3 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
15 years 3 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
CPC
2010
74views more  CPC 2010»
15 years 2 months ago
Playing to Retain the Advantage
Let P be a monotone increasing graph property, let G = (V, E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the ed...
Noga Alon, Dan Hefetz, Michael Krivelevich
JELIA
2004
Springer
15 years 10 months ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek