Sciweavers

8933 search results - page 355 / 1787
» Usability over time
Sort
View
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 10 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
EOR
2010
110views more  EOR 2010»
15 years 6 months ago
Pricing surplus server capacity for mean waiting time sensitive customers
Resources including various assets of supply chains, face random demand over time and can be shared by others. We consider an operational setting where a resource is shared by two...
Sudhir K. Sinha, N. Rangaraj, N. Hemachandra
CORR
2002
Springer
166views Education» more  CORR 2002»
15 years 6 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
NETWORK
2007
93views more  NETWORK 2007»
15 years 6 months ago
Modeling VoIP Call Holding Times for Telecommunications
Voice over IP is one of the most popular applications in broadband access networks. It is anticipated that the characteristics of call holding times (CHTs) for VoIP calls will be ...
Whai-En Chen, Hui-Nien Hung, Yi-Bing Lin
MSR
2011
ACM
14 years 9 months ago
Do time of day and developer experience affect commit bugginess
Modern software is often developed over many years with hundreds of thousands of commits. Commit metadata is a rich source of social characteristics, including the commit’s time...
Jon Eyolfson, Lin Tan, Patrick Lam