Sciweavers

2150 search results - page 42 / 430
» On a restricted cross-intersection problem
Sort
View
CORR
2007
Springer
217views Education» more  CORR 2007»
14 years 9 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
15 years 7 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
AAAI
2012
13 years 3 days ago
MOMDPs: A Solution for Modelling Adaptive Management Problems
In conservation biology and natural resource management, adaptive management is an iterative process of improving management by reducing uncertainty via monitoring. Adaptive manag...
Iadine Chades, Josie Carwardine, Tara G. Martin, S...
79
Voted
INFORMATICALT
2002
150views more  INFORMATICALT 2002»
14 years 9 months ago
Search for Dynamic Equilibrium in Duel Problems by Global Optimization
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...
Raimundas Matulevicius
PODS
2007
ACM
119views Database» more  PODS 2007»
15 years 9 months ago
Reasoning about XML update constraints
XML and semi-structured data are now de-facto standards for data exchange, and it is often the case that published or exchanged XML documents have specic restrictions on how they ...
Bogdan Cautis, Serge Abiteboul, Tova Milo