Sciweavers

14084 search results - page 2747 / 2817
» A Theory for Game Theories
Sort
View
JCNS
2007
77views more  JCNS 2007»
13 years 9 months ago
Threshold fatigue and information transfer
Neurons in vivo must process sensory information in the presence of significant noise. It is thus plausible to assume that neural systems have developed mechanisms to reduce this n...
Maurice J. Chacron, Benjamin Lindner, André...
JCT
2007
111views more  JCT 2007»
13 years 9 months ago
Removing even crossings
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
JETAI
2007
131views more  JETAI 2007»
13 years 9 months ago
A computational architecture for heterogeneous reasoning
Reasoning, problem solving, indeed the general process of acquiring knowledge, is not an isolated, homogenous affair involving a one agent using a single form of representation, b...
Dave Barker-Plummer, John Etchemendy
TON
2008
107views more  TON 2008»
13 years 9 months ago
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
JGT
2007
130views more  JGT 2007»
13 years 9 months ago
Vertex partitions and maximum degenerate subgraphs
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
Martín Matamala
« Prev « First page 2747 / 2817 Last » Next »