Sciweavers

10493 search results - page 322 / 2099
» Dynamic Word Problems
Sort
View
APAL
2004
81views more  APAL 2004»
15 years 6 months ago
The complexity of first-order and monadic second-order logic revisited
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...
Markus Frick, Martin Grohe
ORL
2008
87views more  ORL 2008»
15 years 5 months ago
On-line scheduling with non-crossing constraints
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Lele Zhang, Kwanniti Khammuang, Andrew Wirth
WWW
2003
ACM
16 years 7 months ago
Monitoring the dynamic web to respond to continuous queries
Continuous queries are queries for which responses given to users must be continuously updated, as the sources of interest get updated. Such queries occur, for instance, during on...
Sandeep Pandey, Krithi Ramamritham, Soumen Chakrab...
149
Voted
VLDB
2005
ACM
116views Database» more  VLDB 2005»
16 years 3 days ago
Client Assignment in Content Dissemination Networks for Dynamic Data
Consider a content distribution network consisting of a set of sources, repositories and clients where the sources and the repositories cooperate with each other for efficient di...
Shetal Shah, Krithi Ramamritham, Chinya V. Ravisha...
GECCO
2003
Springer
163views Optimization» more  GECCO 2003»
15 years 12 months ago
Swarms in Dynamic Environments
Charged particle swarm optimization (CPSO) is well suited to the dynamic search problem since inter-particle repulsion maintains population diversity and good tracking can be achie...
T. M. Blackwell