16666 search results - page 2587 / 3334 » Descriptive and Computational Complexity |
239
click to vote
PPSC
2001
15 years 9 months ago
2001
Crew pairing generation is a time consuming part of the complex process of airline crew scheduling. We present a parallel algorithm for this problem's solution and several im...
182
click to vote
ICAI
2003
15 years 9 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
218
click to vote
SBBD
2004
15 years 8 months ago
2004
An enormous amount of information is currently available through specialized services of digital libraries (DLs). However the specification and development of DLs are very complex...
203
click to vote
SFP
2004
15 years 8 months ago
2004
NiMo (Nets in Motion) is a visual environment aimed to support totally graphic programming in Data Flow style, with a strong functional inspiration. Solutions of growing complexit...
213
click to vote
IJCAI
2003
15 years 8 months ago
2003
In this paper we propose a methodology to learn to extract domain-specific information from large repositories (e.g. the Web) with minimum user intervention. Learning is seeded b...