Sciweavers

8413 search results - page 123 / 1683
» Ordering Problem Subgoals
Sort
View
AIPS
2010
13 years 8 months ago
Forward-Chaining Partial-Order Planning
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
IWPEC
2009
Springer
14 years 2 months ago
Improved Parameterized Algorithms for the Kemeny Aggregation Problem
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
Narges Simjour
DM
2008
58views more  DM 2008»
13 years 8 months ago
The vertex isoperimetric problem for the powers of the diamond graph
We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
Sergei L. Bezrukov, Miquel Rius, Oriol Serra
JOLLI
2010
78views more  JOLLI 2010»
13 years 6 months ago
On the Membership Problem for Non-Linear Abstract Categorial Grammars
embership problem for non-linear Abstract Categorial Grammars Sylvain Salvati Abstract In this paper we show that the membership problem for second order nonbstract Categorial Gram...
Sylvain Salvati
AINA
2009
IEEE
14 years 1 months ago
Preference Ordering in Agenda Based Multi-issue Negotiation for Service Level Agreement
—This paper discusses multi-issue negotiation between agents such as providers and consumers in a group decision making environment. The outcome of such encounters depends on two...
Fahmida Abedin, Kuo-Ming Chao, Nick Godwin, Hisbel...