2485 search results - page 354 / 497 » Time Bounded Frequency Computations |
169
click to vote
SODA
2010
ACM
16 years 21 days ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
135
click to vote
QEST
2007
IEEE
15 years 9 months ago
2007
IEEE
Stochastic game logic (SGL) is a new temporal logic that combines features of alternating temporal logic (to formalize the individual views and cooperation and reaction facilities...
110
click to vote
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
ESA
2007
Springer
15 years 9 months ago
2007
Springer
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the dis...
121
click to vote
LATA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...