Sciweavers

1220 search results - page 68 / 244
» Restricting grammatical complexity
Sort
View
EOR
2008
119views more  EOR 2008»
13 years 7 months ago
A General Vehicle Routing Problem
In this paper we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined ...
Asvin Goel, Volker Gruhn
IWOCA
2010
Springer
223views Algorithms» more  IWOCA 2010»
13 years 2 months ago
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
Konrad Dabrowski, Vadim V. Lozin, Haiko Mülle...
DLOG
2011
12 years 11 months ago
Unchain My EL Reasoner
We study a restriction of the classification procedure for EL++ where the inference rule for complex role inclusion axioms (RIAs) is applied in a “left-linear” way in analogy ...
Yevgeny Kazakov, Markus Krötzsch, Frantisek S...
CORR
2012
Springer
174views Education» more  CORR 2012»
12 years 3 months ago
Partial Searchlight Scheduling is Strongly PSPACE-complete
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
Giovanni Viglietta
ECAL
2007
Springer
14 years 1 months ago
Multi-level Selection in the Emergence of Language Systematicity
Language can be viewed as a complex adaptive system which is continuously shaped and reshaped by the actions of its users as they try to solve communicative problems. To maintain c...
Luc Steels, Remi van Trijp, Pieter Wellens