1707 search results - page 277 / 342 » Early Integer Programming |
COLOGNETWENTE
2010
14 years 6 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Dynamic airspace configuration (DAC) algorithms strive to restructure the U.S. National Airspace System (NAS) in ways that allow air traffic control to better manage aircraft flows...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Three essential criteria are important for activity planning, including: (1) finding a group of attendees familiar with the initiator, (2) ensuring each attendee in the group to ...
COLING
2010
14 years 4 months ago
2010
We present a novel Evaluation Metric for Morphological Analysis (EMMA) that is both linguistically appealing and empirically sound. EMMA uses a graphbased assignment algorithm, op...
110
click to vote
CORR
2010
Springer
14 years 4 months ago
2010
Springer
Abstract--Based on the false assumption that multicast incapable (MI) nodes could not be traversed twice on the same wavelength, the light-tree structure was always thought to be o...