Sciweavers

7796 search results - page 182 / 1560
» On Generalized Schur Numbers
Sort
View
BIRTHDAY
2009
Springer
15 years 7 months ago
An ASM-Characterization of a Class of Distributed Algorithms
Conventional computation models restrict to particular data structures to represent states of a computation, e.g. natural numbers, s, stacks, etc. Gurevich's Abstract State Ma...
Andreas Glausch, Wolfgang Reisig
ENDM
2007
75views more  ENDM 2007»
15 years 6 months ago
Graph classes with given 3-connected components: asymptotic counting and critical phenomena
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
Omer Giménez, Marc Noy, Juan José Ru...
JPDC
2006
92views more  JPDC 2006»
15 years 6 months ago
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
Sheng-Hsiung Chen, Ting-Lu Huang
LOGCOM
2002
85views more  LOGCOM 2002»
15 years 6 months ago
Engineering Executable Agents using Multi-context Systems
In the area of agent-based computing there are many proposals for specific system architectures, and a number of proposals for general approaches to building agents. As yet, howev...
Jordi Sabater, Carles Sierra, Simon Parsons, Nicho...
SIAMDM
2010
123views more  SIAMDM 2010»
15 years 5 months ago
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Fe...