Sciweavers

1002 search results - page 55 / 201
» Constraint Answer Set Solving
Sort
View
AMAI
1999
Springer
13 years 7 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
11 years 10 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
EOR
2008
99views more  EOR 2008»
13 years 8 months ago
Ordinal regression revisited: Multiple criteria ranking using a set of additive value functions
We present a new method, called UTAGMS , for multiple criteria ranking of alternatives from set A using a set of additive value functions which result from an ordinal regression. ...
Salvatore Greco, Vincent Mousseau, Roman Slowinski
IAT
2003
IEEE
14 years 1 months ago
Problem-solving in open environments
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
Santiago Macho-Gonzalez, Boi Faltings
SAS
2007
Springer
14 years 2 months ago
Refactoring Using Type Constraints
Type constraints express subtype-relationships between the types of program expressions that are required for type-correctness, and were originally proposed as a convenient framewo...
Frank Tip