TCS 2010 - PDF Preprint Papers

TCS 2010 International Conference on Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TCS-2010 Paper

click to vote

TCS
2010

187views Theoretical Computer Science» more TCS 2010»

Analyzing the dynamics of stigmergetic interactions through pheromone games

13 years 2 months ago

Download como.vub.ac.be

The concept of stigmergy provides a simple framework for interaction and coordination in multi-agent systems. However, determining the global system behavior that will arise from ...

Peter Vrancx, Katja Verbeeck, Ann Nowé

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	187	Analyzing the dynamics of stigmergetic interactions through pheromone games	claim
2	186	A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs	claim
3	184	Non-confluence in divisionless P systems with active membranes	claim
4	174	Clustering with partial information	claim
5	169	Alternating states for dual nondeterminism in imperative programming	claim
6	164	Parametric random generation of deterministic tree automata	claim
7	155	Window-games between TCP flows	claim
8	152	A fluid analysis framework for a Markovian process algebra	claim
9	151	Strong normalization property for second order linear logic	claim
10	151	Dcpo-completion of posets	claim
11	151	CSP duality and trees of bounded pathwidth	claim
12	150	Canonical finite state machines for distributed systems	claim
13	149	Randomized priority algorithms	claim
14	149	Invariant games	claim
15	147	Definable transductions and weighted logics for texts	claim
16	145	On the computational power of BlenX	claim
17	145	Tight results for Next Fit and Worst Fit with resource augmentation	claim
18	145	Monad transformers as monoid transformers	claim
19	144	Weak bisimulation for Probabilistic Timed Automata	claim
20	142	Deadline scheduling and power management for speed bounded processors	claim
21	141	Arrows for secure information flow	claim
22	141	Iterative compression and exact algorithms	claim
23	141	Runtime analysis of a binary particle swarm optimizer	claim
24	137	Computing the graph-based parallel complexity of gene assembly	claim
25	136	Incremental learning with temporary memory	claim
26	136	Left-forbidding cooperating distributed grammar systems	claim
27	135	Active learning in heteroscedastic noise	claim
28	135	The category-theoretic solution of recursive metric-space equations	claim
29	135	A comparison of semantic models for noninterference	claim
30	134	A compact fixpoint semantics for term rewriting systems	claim
31	133	A comprehensive analysis of degree based condition for Hamiltonian cycles	claim
32	133	Maximum likelihood analysis of algorithms and data structures	claim
33	133	Comparing free algebras in Topological and Classical Domain Theory	claim
34	133	Class constrained bin packing revisited	claim
35	133	A combinatorial approach to the analysis of bucket recursive trees	claim
36	133	Analysis of a cellular automaton model for car traffic with a slow-to-stop rule	claim
37	132	On the complexities of consistency checking for restricted UML class diagrams	claim
38	132	On the expressiveness of interaction	claim
39	131	Non-cooperative facility location and covering games	claim
40	130	A graph theoretic approach to general Euler diagram drawing	claim
41	126	An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps	claim
42	125	Comparing First-Fit and Next-Fit for online edge coloring	claim
43	124	The relevant prefixes of coloured Motzkin walks: An average case analysis	claim
44	124	Resource allocation with time intervals	claim
45	123	Euclidean TSP on two polygons	claim
46	123	Cops and Robbers from a distance	claim
47	123	Combinatorics of labelling in higher-dimensional automata	claim
48	123	Information measures for infinite sequences	claim
49	122	Detecting synchronisation of biological oscillators by model checking	claim
50	121	The College Admissions problem with lower and common quotas	claim
51	121	Contract-based discovery of Web services modulo simple orchestrators	claim
52	120	Parameterized algorithms for d-Hitting Set: The weighted case	claim
53	120	Factorization forests for infinite words and applications to countable scattered linear orderings	claim
54	119	Translating propositional extended conjunctions of Horn clauses into Boolean circuits	claim
55	119	Query-based verification of qualitative trends and oscillations in biochemical systems	claim
56	118	Maximal width learning of binary functions	claim
57	118	Stability analysis of the reproduction operator in bacterial foraging optimization	claim
58	118	Maximizing the minimum load for selfish agents	claim
59	117	Theory of one-tape linear-time Turing machines	claim
60	113	Towards practical feasibility of core computation in data exchange	claim
61	112	Itineraries of rigid rotations and diffeomorphisms of the circle	claim
62	112	Comparing notions of randomness	claim
63	111	On a special class of primitive words	claim
64	111	A hierarchical strongly aperiodic set of tiles in the hyperbolic plane	claim
65	110	A class of hierarchical graphs as topologies for interconnection networks	claim
66	110	Adaptive star grammars and their languages	claim
67	108	A trajectory-based strict semantics for program slicing	claim
68	107	Error-repair parsing schemata	claim
69	106	Size versus stability in the marriage problem	claim
70	106	On convex complexity measures	claim
71	106	Improved upper bounds for vertex cover	claim
72	106	Bounds on the efficiency of black-box commitment schemes	claim
73	105	On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs	claim
74	104	Optimal bounds on finding fixed points of contraction mappings	claim
75	103	Simulation of one-way cellular automata by boolean circuits	claim
76	101	On-demand strategy annotations revisited: An improved on-demand evaluation strategy	claim
77	97	Finding common structured patterns in linear graphs	claim
78	94	Verifying parallel programs with dynamic communication structures	claim
79	92	An exact correspondence between a typed pi-calculus and polarised proof-nets	claim
80	91	The multiple facets of the canonical direct unit implicational basis	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers