Sciweavers

4767 search results - page 253 / 954
» Moving between Contexts
Sort
View
IPL
2006
120views more  IPL 2006»
15 years 6 months ago
Propositional dynamic logic of context-free programs and fixpoint logic with chop
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
Martin Lange, Rafal Somla
JSYML
2010
103views more  JSYML 2010»
15 years 1 months ago
A note on Hjorth's oscillation theorem
We reformulate, in the context of continuous logic, an oscillation theorem proved by G. Hjorth and give a proof of the theorem in that setting which is similar to, but simpler than...
Julien Melleray
SIAMDM
2010
64views more  SIAMDM 2010»
15 years 1 months ago
Mixed Statistics on 01-Fillings of Moon Polyominoes
We establish a stronger symmetry between the numbers of northeast and southeast chains in the context of 01-fillings of moon polyominoes. Let M be a moon polyomino with n rows and...
William Y. C. Chen, Andrew Y. Z. Wang, Catherine H...
ICDCS
2011
IEEE
14 years 6 months ago
The Routing Continuum from Shortest-Path to All-Path: A Unifying Theory
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
Yanhua Li, Zhi-Li Zhang, Daniel Boley
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
16 years 1 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi