Sciweavers

2354 search results - page 198 / 471
» Assignment Problems
Sort
View
LICS
1999
IEEE
15 years 10 months ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke
COCOON
2006
Springer
15 years 8 months ago
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishiz...
142
Voted
COLING
2008
15 years 7 months ago
What's the Date? High Accuracy Interpretation of Weekday Names
In this paper we present a study on the interpretation of weekday names in texts. Our algorithm for assigning a date to a weekday name achieves 95.91% accuracy on a test data set ...
Pawel P. Mazur, Robert Dale
SEDE
2007
15 years 7 months ago
A software tool for optimal class-hierarchy design based on the use-relationship among functions and variables
We present a software tool for creating an optimal classhierarchy from the use-relationship among data-items and functions based on the method in Kundu and Gwee [3]. The tool dete...
Nigel Gwee, Sukhamay Kundu
NETWORKING
2004
15 years 7 months ago
A New Method of Primary Routes Selection for Local Restoration
We consider the problem of non-bifurcated multicommodity flows rerouting in survivable connection-oriented networks. We focus on local restoration, in which the backup route is rer...
Krzysztof Walkowiak