Sciweavers

1711 search results - page 311 / 343
» Completing pseudojump operators
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
13 years 8 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
ESWA
2008
162views more  ESWA 2008»
13 years 7 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
CCR
2006
89views more  CCR 2006»
13 years 7 months ago
A passive state-machine approach for accurate analysis of TCP out-of-sequence segments
In this paper we describe a new tool being made available to the networking research community for passive analysis of TCP segment traces. The purpose of the tool is to provide mo...
Sushant Rewaskar, Jasleen Kaur, F. Donelson Smith
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 7 months ago
A Combined LIFO-Priority Scheme for Overload Control of E-commerce Web Servers
E-commerce Web-servers often face overload conditions during which revenue-generating requests may be dropped or abandoned due to an increase in the browsing requests. In this pap...
Naresh Singhmar, Vipul Mathur, Varsha Apte, D. Man...
COMBINATORICA
2007
148views more  COMBINATORICA 2007»
13 years 7 months ago
Colored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
Richard N. Ball, Ales Pultr, Petr Vojtechovsk&yacu...