Sciweavers

2129 search results - page 419 / 426
» Cutting-Edge Timing Analysis Techniques
Sort
View
LREC
2008
75views Education» more  LREC 2008»
14 years 11 months ago
Experimental Fast-Tracking of Morphological Analysers for Nguni Languages
The development of natural language processing (NLP) components is resource-intensive and therefore justifies exploring ways of reducing development time and effort when building ...
Sonja E. Bosch, Laurette Pretorius, Kholisa Podile...
AAAI
2000
14 years 11 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
LISA
1993
14 years 11 months ago
Forecasting Disk Resource Requirements for a Usenet Server
Three years ago the Stanford Linear Accelerator Center (SLAC) decided to embrace netnews as a site-wide, multi-platform communications tool for the laboratory’s diverse user com...
Karl L. Swartz
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
14 years 10 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
14 years 9 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna