| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Somsubhra Sharangi, Ramesh Krishnamurti, Mohamed Hefeeda |
Energy-Efficient Multicasting of Scalable Video Streams Over WiMAX Networks.  |
IEEE Transactions on Multimedia  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli |
Erratum to: The capacitated max k-cut problem.  |
Math. Program.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pengpeng Wang, Kamal Gupta, Ramesh Krishnamurti |
Some Complexity Results for Metric View Planning Problem With Traveling Cost and Visibility Range.  |
IEEE T. Automation Science and Engineering  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ajla Aksamija, Kui Yue, Hyunjoo Kim, Francois Grobler, Ramesh Krishnamurti |
Integration of knowledge-based and generative systems for building characterization and prediction.  |
AI EDAM  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta |
Generalized Watchman Route Problem with Discrete View Cost.  |
Int. J. Comput. Geometry Appl.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Somsubhra Sharangi, Ramesh Krishnamurti, Mohamed Hefeeda |
Streaming scalable video over WiMAX networks.  |
IWQoS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli |
Conflict Resolution in the Scheduling of Television Commercials.  |
Operations Research  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Salimur Choudhury, Daya Ram Gaur, Ramesh Krishnamurti |
An Approximation Algorithm for Max k-Uncut with Capacity Constraints.  |
CSO  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Self-duality of bounded monotone boolean functions and related problems.  |
Discrete Applied Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli |
The capacitated max k -cut problem.  |
Math. Program.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudi Stouffs, Ramesh Krishnamurti, Kuhn Park |
Sortal Structures: Supporting Representational Flexibility for Building Domain Processes.  |
Comp.-Aided Civil and Infrastruct. Engineering  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta |
Generalized Watchman Route Problem with Discrete View Cost.  |
CCCG  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta |
Metric View Planning Problem with Traveling Cost and Visibility Range.  |
ICRA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta |
View Planning Problem with Combined View and Traveling Cost.  |
ICRA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Snezana Mitrovic-Minic, Ramesh Krishnamurti |
The multiple TSP with time windows: vehicle bounds based on precedence graphs.  |
Oper. Res. Lett.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Krishnamurti, Daya Ram Gaur, Subir Kumar Ghosh, Horst Sachs |
Berge's theorem for the maximum charge problem.  |
Discrete Optimization  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Krishnamurti |
Explicit design space?  |
AI EDAM  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Kohli, Ramesh Krishnamurti, Kamel Jedidi |
Subset-conjunctive rules for breast cancer diagnosis.  |
Discrete Applied Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch |
Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times.  |
ACiD  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Kui Yue, Daniel Huber, Burcu Akinci, Ramesh Krishnamurti |
The ASDMCon Project: The Challenge of Detecting Defects on Construction Sites.  |
3DPVT  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Faster approximation algorithms for scheduling tasks with a choice of start times.  |
CCCG  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
The Capacitated max-k-cut Problem.  |
ICCSA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani |
Average performance of greedy heuristics for the integer knapsack problem.  |
European Journal of Operational Research  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Average Case Self-Duality of Monotone Boolean Functions.  |
Canadian Conference on AI  |
2004 |
DBLP DOI BibTeX RDF |
Machine Learning, Knowledge Representation, Satisfiability, Self-duality, Monotone Boolean Functions |
| 1 | Daya Ram Gaur, Arvind Gupta, Ramesh Krishnamurti |
A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times.  |
Inf. Process. Lett.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito |
On polynomial-time approximation algorithms for the variable length scheduling problem.  |
Theor. Comput. Sci.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Arvind Gupta, Ramesh Krishnamurti |
Parallel Algorithms For Vehicle Routing Problems.  |
Parallel Processing Letters  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Scheduling Intervals Using Independent Sets in Claw-Free Graphs.  |
ICCSA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti |
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.  |
J. Algorithms  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability.  |
J. Comb. Optim.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti |
Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.  |
ESA  |
2000 |
DBLP DOI BibTeX RDF |
Rectangle Stabbing, Rectilinear Partitioning, Approximation Algorithms, Combinatorial Optimization |
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Self-Duality of Bounded Monotone Boolean Functions and Related Problems.  |
ALT  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Krishnamurti, Daya Ram Gaur |
An Approximation Algorithm for Nonpreemptive Scheduling on Hypercube Parallel Task Systems.  |
Inf. Process. Lett.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Ramesh Krishnamurti |
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability.  |
ISAAC  |
1999 |
DBLP DOI BibTeX RDF |
hypergraph 2-colorability, set splitting, maxnaesp, approximation algorithms, max-cut |
| 1 | Ramesh Krishnamurti, Bhagirath Narahari |
An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems.  |
SIAM J. Discrete Math.  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Kohli, Ramesh Krishnamurti |
Joint Performance of Greedy Heuristics for the Integer Knapsack Problem.  |
Discrete Applied Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Kohli, Ramesh Krishnamurti, Prakash Mirchandani |
The Minimum Satisfiability Problem.  |
SIAM J. Discrete Math.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Alok N. Choudhary, Bhagirath Narahari, Ramesh Krishnamurti |
An Efficient Heuristic Scheme for Dynamic Remapping of Parallel Computations.  |
Parallel Computing  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Bhagirath Narahari, Ramesh Krishnamurti |
Scheduling Independent Tasks of Partitionable Hypercube Multiprocessors.  |
IPPS  |
1993 |
DBLP BibTeX RDF |
|
| 1 | Ramesh Krishnamurti |
An Approximation Algorithm for Scheduling Tasks on Varying Partition Sizes in Partitionable Multiprocessor Systems.  |
IEEE Trans. Computers  |
1992 |
DBLP DOI BibTeX RDF |
parameter dependent bound, asymptotically tight bound, partition sizes, partitionable multiprocessor systems, multiple partitions, minimum completion time schedule, worst-case performance bound, scheduling, parallel algorithms, computational complexity, approximation algorithm, parallelization, controller, multiprocessing systems, NP-hard, task scheduling, polynomial time algorithm, processors, multiprocessing programs |
| 1 | Ramesh Krishnamurti, Bhagirath Narahari |
Optimal Subcube Assignment for Partitionable Hypercubes.  |
Parallel Processing Letters  |
1992 |
DBLP BibTeX RDF |
|
| 1 | Ramesh Krishnamurti, Bhagirath Narahari |
Preemptive Scheduling of Independent Jobs on Partitionable Parallel Architectures.  |
ICPP  |
1992 |
DBLP BibTeX RDF |
|
| 1 | Rajeev Kohli, Ramesh Krishnamurti |
Average Performance of Heuristics for Satisfiability.  |
SIAM J. Discrete Math.  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Krishnamurti, Eva Ma |
The Processor Partitioning Problem In Special-Purpose Partitionable Systems.  |
ICPP  |
1988 |
DBLP BibTeX RDF |
|