Sciweavers

1222 search results - page 231 / 245
» Some Results on Directable Automata
Sort
View
TREC
2004
13 years 8 months ago
From the Texts to the Contexts They Contain: A Chain of Linguistic Treatments
The text-mining system we are building deals with the specific problem of identifying the instances of relevant concepts present in the texts. Therefore, our system relies on inte...
Ahmed Amrani, Jérôme Azé, Thom...
LISA
2003
13 years 8 months ago
Three Practical Ways to Improve Your Network
This paper presents three simple techniques for improving network service using relatively unknown features of many existing networks. The resulting system provides greater reliab...
Kevin Miller
WSC
1997
13 years 8 months ago
Selective Rerouting Using Simulated Steady State System Data
Effective operational control of a manufacturing system that has routing flexibility is dependent upon being able to make informed real-time decisions in the event of a system dis...
Catherine M. Harmonosky, Robert H. Farr, Ming-Chua...
SIGCOMM
2010
ACM
13 years 7 months ago
Theory and new primitives for safely connecting routing protocol instances
Recent studies have shown that the current primitives for connecting multiple routing protocol instances (OSPF 1, OSPF 2, EIGRP 10, etc.) are pervasively deployed in enterprise ne...
Franck Le, Geoffrey G. Xie, Hui Zhang
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 7 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