Sciweavers

1158 search results - page 128 / 232
» Software is discrete mathematics
Sort
View
TALG
2008
67views more  TALG 2008»
14 years 10 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
TALG
2008
97views more  TALG 2008»
14 years 10 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
IPL
2007
99views more  IPL 2007»
14 years 10 months ago
Approximation algorithms for minimizing segments in radiation therapy
Intensity modulated radiation therapy (IMRT) is one of the most effective modalities for modern cancer treatment. The key to successful IMRT treatment hinges on the delivery of a...
Shuang Luan, Jared Saia, Maxwell Young
JUCS
2007
90views more  JUCS 2007»
14 years 10 months ago
Distance Learning and Student Satisfaction in Java Programming Courses
: Student satisfaction with distance learning is impacted by a variety of factors, including interaction with the instructor and the structure of the course. Satisfaction with dist...
Amber Settle, Chad Settle
COR
2004
106views more  COR 2004»
14 years 10 months ago
Performance analysis of the DAR(1)/D/c priority queue under partial buffer sharing policy
We analyze a multi-server priority queueing system with partial buffer sharing, where the input is a discrete autoregressive process of order 1 (DAR(1)) which is known as a good m...
Gang Uk Hwang, Bong Dae Choi