Sciweavers

4714 search results - page 273 / 943
» The Complexity of Iterated Multiplication
Sort
View
FLAIRS
2008
15 years 8 months ago
Neptune: A Mixed-Initiative Environment for Planning and Scheduling
We describe the design of a user-centric, integrated planning and scheduling system that assists the user in exploring the rich space of plans and associated resource assignment o...
Pauline M. Berry, Blazej Bulka, Bart Peintner, Mar...
163
Voted
ACL
2006
15 years 7 months ago
Names and Similarities on the Web: Fact Extraction in the Fast Lane
In a new approach to large-scale extraction of facts from unstructured text, distributional similarities become an integral part of both the iterative acquisition of high-coverage...
Marius Pasca, Dekang Lin, Jeffrey Bigham, Andrei L...
144
Voted
NAACL
2003
15 years 7 months ago
Greedy Decoding for Statistical Machine Translation in Almost Linear Time
We present improvements to a greedy decoding algorithm for statistical machine translation that reduce its time complexity from at least cubic (  ¢¡¤£¦¥¨§ when applied na...
Ulrich Germann
ICMAS
1998
15 years 7 months ago
Multi-Machine Scheduling - A Multi-Agent Learning Approach
Multi-machine scheduling, that is, the assigment of jobs to machines such that certain performance demands like cost and time effectiveness are fulfilled, is a ubiquitous and comp...
Wilfried Brauer, Gerhard Weiß
SIAMNUM
2010
87views more  SIAMNUM 2010»
15 years 27 days ago
A Note on the Computation of All Zeros of Simple Quaternionic Polynomials
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
Drahoslava Janovská, Gerhard Opfer