Sciweavers

2157 search results - page 170 / 432
» Binary ant algorithm
Sort
View
AIPS
2007
15 years 8 months ago
On the Hardness of Planning Problems with Simple Causal Graphs
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
Omer Giménez, Anders Jonsson
EMNLP
2006
15 years 7 months ago
Learning Information Status of Discourse Entities
In this paper we address the issue of automatically assigning information status to discourse entities. Using an annotated corpus of conversational English and exploiting morpho-s...
Malvina Nissim
BILDMED
2009
124views Algorithms» more  BILDMED 2009»
15 years 7 months ago
Evaluation of the Twofold Gaussian Mixture Model Applied to Clinical Volume Datasets
Abstract. Volume representations of blood vessels acquired by 3D rotational angiography are very suitable for diagnosing a stenosis or an aneurysm. For optimal treatment, physician...
Jan Bruijns
JAIR
2008
99views more  JAIR 2008»
15 years 6 months ago
The Complexity of Planning Problems With Simple Causal Graphs
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
Omer Giménez, Anders Jonsson
DATE
2008
IEEE
107views Hardware» more  DATE 2008»
16 years 22 days ago
Instruction Set Extension Exploration in Multiple-Issue Architecture
To satisfy high-performance computing demand in modern embedded devices, current embedded processor architectures provide designer with possibility either to define customized ins...
I-Wei Wu, Zhi-Yuan Chen, Jean Jyh-Jiun Shann, Chun...