Sciweavers

4451 search results - page 402 / 891
» On Random Ordering Constraints
Sort
View
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
16 years 1 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
HIPC
2000
Springer
15 years 10 months ago
Memory Consistency and Process Coordination for SPARC Multiprocessors
Abstract. Simple and unified non-operational specifications of the three memory consistency models Total Store Ordering (TSO), Partial Store Ordering (PSO), and Relaxed Memory Orde...
Lisa Higham, Jalal Kawash
AIPS
2004
15 years 8 months ago
Domain-Specific Preferences for Causal Reasoning and Planning
We address the issue of incorporating domain-specific preferences in planning systems, where a preference may be seen as a "soft" constraint that it is desirable, but no...
James P. Delgrande, Torsten Schaub, Hans Tompits
ACL
2006
15 years 8 months ago
Simultaneous English-Japanese Spoken Language Translation Based on Incremental Dependency Parsing and Transfer
This paper proposes a method for incrementally translating English spoken language into Japanese. To realize simultaneous translation between languages with different word order, ...
Koichiro Ryu, Shigeki Matsubara, Yasuyoshi Inagaki
ECRTS
2009
IEEE
15 years 4 months ago
On-Line Scheduling Algorithm for the Gravitational Task Model
Some applications for real-time scheduling have target demands in addition to the commonly used starttime and deadline constraints: a task should be executed at a target point in ...
Raphael Guerra, Gerhard Fohler