Sciweavers

2714 search results - page 391 / 543
» Approximation Schemes for Scheduling
Sort
View
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
15 years 5 months ago
Structural Properties and Tractability Results for Linear Synteny
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
David Liben-Nowell, Jon M. Kleinberg
COMPSAC
1999
IEEE
15 years 5 months ago
Brooks' Law Revisited: A System Dynamics Approach
The Brooks' Law says that adding manpower to a late software project makes it later. Brooks developed the law through observation of many projects and derived the generalizat...
Pei Hsia, Chih-Tung Hsu, David Chenho Kung
85
Voted
LCPC
1994
Springer
15 years 4 months ago
Minimal Data Dependence Abstractions for Loop Transformations
Data Dependence Abstractions for Loop Transformations Yi-Qing Yang Corinne Ancourt Francois Irigoin Ecole des Mines de Paris/CRI 77305 Fontainebleau Cedex France tractions of prog...
Yi-Qing Yang, Corinne Ancourt, François Iri...
82
Voted
APNOMS
2006
Springer
15 years 4 months ago
DSMRouter: A DiffServ-Based Multicast Router
In this paper, we realize a DiffServ-based Multicast Router (DSMRouter) to provide the QoS adjustment for multicasting video transmission in the DiffServ network. To reach the QoS ...
Yong Jiang
111
Voted
AAAI
2008
15 years 3 months ago
Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...