Sciweavers

3019 search results - page 336 / 604
» Approximating the Domatic Number
Sort
View
CIS
2004
Springer
16 years 1 days ago
Algorithms for Loosely Constrained Multiple Sequence Alignment
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
Bin Song, Fengfeng Zhou, Guoliang Chen
CSCLP
2004
Springer
16 years 1 days ago
Better Propagation for Non-preemptive Single-Resource Constraint Problems
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...
Armin Wolf
ICALP
2004
Springer
16 years 1 days ago
The Power of Verification for One-Parameter Agents
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
ICOIN
2004
Springer
16 years 22 hour ago
Performance of New Broadcast Forwarding Criteria in MANET
In a mobile ad hoc network (MANET), packet broadcast is common and frequently used to disseminate information. Broadcast consume large amount of bandwidth resource, which is scarce...
Lijuan Zhu, Bu-Sung Lee, Boon-Chong Seet, Kai Juan...
ISAAC
2004
Springer
207views Algorithms» more  ISAAC 2004»
16 years 16 hour ago
Pareto Optimality in House Allocation Problems
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
David J. Abraham, Katarína Cechlárov...