Sciweavers

2950 search results - page 463 / 590
» Computing with Infinitely Many Processes
Sort
View
108
Voted
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 2 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
JUCS
2007
108views more  JUCS 2007»
15 years 2 months ago
On Pipelining Sequences of Data-Dependent Loops
: Sequences of data-dependent tasks, each one traversing large data sets, exist in many applications (such as video, image and signal processing applications). Those tasks usually ...
Rui Rodrigues, João M. P. Cardoso
CORR
2004
Springer
128views Education» more  CORR 2004»
15 years 2 months ago
Specialization of Functional Logic Programs Based on Needed Narrowing
Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolutio...
María Alpuente, Michael Hanus, Salvador Luc...
CCR
2002
111views more  CCR 2002»
15 years 2 months ago
A taxonomy and design considerations for Internet accounting
Economic principles are increasingly being suggested for addressing some complex issues related to distributed resource allocation for QoS (Quality of Service) enhancement. Many p...
Michel Kouadio, Udo W. Pooch
COLING
2002
15 years 2 months ago
Study of Practical Effectiveness for Machine Translation Using Recursive Chain-link-type Learning
A number of machine translation systems based on the learning algorithms are presented. These methods acquire translation rules from pairs of similar sentences in a bilingual text...
Hiroshi Echizen-ya, Kenji Araki, Yoshio Momouchi, ...