Sciweavers

1370 search results - page 139 / 274
» On grids in topological graphs
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
CIKM
1993
Springer
15 years 10 months ago
Model-driven Hypermedia Access to Weather Information
: A framework is presented for hypermedia access to weather information originating from gridded data sets. The information is presented on different media (map, text, graph, table...
Stephan M. Kerpedjiev
DLOG
2009
15 years 4 months ago
Testing Provers on a Grid - Framework Description
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
Carlos Areces, Daniel Gorín, Alejandra Lore...
LICS
2012
IEEE
13 years 8 months ago
Graph Logics with Rational Relations and the Generalized Intersection Problem
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
Pablo Barceló, Diego Figueira, Leonid Libki...
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 8 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell