Sciweavers

949 search results - page 60 / 190
» Theory of Constraints
Sort
View
115
Voted
AI
1998
Springer
15 years 11 days ago
Reasoning About Actions: Steady Versus Stabilizing State Constraints
In formal approaches to commonsense reasoning about actions. the Ramification Problem denotes the problem of handling indirect effects which implicitly derive from so-called state...
Michael Thielscher
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
16 years 1 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
PASTE
2004
ACM
15 years 6 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
125
Voted
KBSE
2010
IEEE
14 years 11 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
97
Voted
WWW
2008
ACM
16 years 1 months ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari