Sciweavers

2835 search results - page 217 / 567
» Automatic Question Answering
Sort
View
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
15 years 10 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
124
Voted
COCOON
2005
Springer
15 years 10 months ago
Bounded Degree Closest k-Tree Power Is NP-Complete
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
Michael Dom, Jiong Guo, Rolf Niedermeier
MABS
2005
Springer
15 years 10 months ago
Formal Interpretation and Analysis of Collective Intelligence as Individual Intelligence
This paper addresses the question to what extent a process involving multiple agents that shows some form of collective intelligence can be interpreted as a single agent. The quest...
Tibor Bosse, Jan Treur
RE
2004
Springer
15 years 10 months ago
From Goals to Aspects: Discovering Aspects from Requirements Goal Models
Aspect-oriented programming (AOP) has been attracting much attention in the Software Engineering community by advocating that programs should be structured according to programmer...
Yijun Yu, Julio Cesar Sampaio do Prado Leite, John...
134
Voted
ECRTS
2003
IEEE
15 years 10 months ago
Resource Partitioning among Real-Time Applications
When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing req...
Giuseppe Lipari, Enrico Bini