Sciweavers

4378 search results - page 40 / 876
» On the Complexity of Ordered Colourings
Sort
View
ACL
1993
13 years 10 months ago
Parsing Free Word Order Languages in the Paninian Framework
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Akshar Bharati, Rajeev Sangal
JETAI
2007
141views more  JETAI 2007»
13 years 8 months ago
Exchange market for complex commodities: search for optimal matches
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...
Eugene Fink, Jianli Gong, Josh Johnson
ICCD
2000
IEEE
93views Hardware» more  ICCD 2000»
14 years 5 months ago
Cheap Out-of-Order Execution Using Delayed Issue
In superscalar architectures, out-of-order issue mechanisms increase performance by dynamically rescheduling instructions that cannot be statically reordered by the compiler. Whil...
J. P. Grossman
DEXAW
2008
IEEE
119views Database» more  DEXAW 2008»
14 years 3 months ago
Evolutionary Approaches to Linear Ordering Problem
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
Václav Snásel, Pavel Krömer, Ja...
ICCS
2004
Springer
14 years 2 months ago
A Real-Time Total Order Multicast Protocol
Abstract. We describe, analyze and submit results of a real-time total order multicast protocol developed on a distributed real-time system architecture that consists of hierarchic...
Kayhan Erciyes, Ahmet Sahan