Sciweavers

664 search results - page 128 / 133
» Some results for a class of generalized polynomials
Sort
View
SPAA
2009
ACM
14 years 2 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
SASO
2008
IEEE
14 years 1 months ago
Towards Desynchronization of Multi-hop Topologies
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
Julius Degesys, Radhika Nagpal
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
14 years 28 days ago
Online View Maintenance Under a Response-Time Constraint
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
Kamesh Munagala, Jun Yang 0001, Hai Yu
CAISE
2004
Springer
14 years 24 days ago
Ontology for Characterising Architecture Frameworks
This paper outlines an ontology for characterising architecture frameworks. The ontology is based on the metamodel of MAF, and is currently being tried out on a set of well-known e...
Oddrun Pauline Ohren